Open AccessA Hybrid Multi-objective Genetic Algorithm for Bi-objective Time Window Assignment Vehicle Routing Problem
Author(s) -
Manman Li,
Jian Lü,
Wei Ma
Publication year - 2019
Publication title -
promet
Language(s) - English
Resource type - Journals
eISSN - 1848-4069
pISSN - 0353-5320
DOI - 10.7307/ptt.v31i5.3057
Subject(s) - vehicle routing problem , genetic algorithm , mathematical optimization , computer science , metaheuristic , customer satisfaction , routing (electronic design automation) , window (computing) , loyalty , operations research , engineering , algorithm , computer network , mathematics , marketing , business , operating system , political science , law
Providing a satisfying delivery service is an important way to maintain the customers’ loyalty and further expand profits for manufacturers and logistics providers. Considering customers’ preferences for time windows, a bi-objective time window assignment vehicle routing problem has been introduced to maximize the total customers’ satisfaction level for assigned time windows and minimize the expected delivery cost. The paper designs a hybrid multi-objective genetic algorithm for the problem that incorporates modified stochastic nearest neighbour and insertion-based local search. Computational results show the positive effect of the hybridization and satisfactory performance of the metaheuristics. Moreover, the impacts of three characteristics are analysed including customer distribution, the number of preferred time windows per customer and customers’ preference type for time windows. Finally, one of its extended problems, the bi-objective time window assignment vehicle routing problem with time-dependent travel times has been primarily studied.