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.
A Hybrid Multi-objective Genetic Algorithm for Bi-objective Time Window Assignment Vehicle Routing Problem
01.01.2019
Promet - Traffic&Transportation ; ISSN 0353-5320 (Print) ; ISSN 1848-4069 (Online) ; Volume 31 ; Issue 5
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
DOAJ | 2019
|A Hybrid Algorithm for the Multi-Objective Time Dependent Vehicle Routing Problem
British Library Conference Proceedings | 2014
|Optimization of Vehicle Routing Problem Based on Multi-Objective Genetic Algorithm
British Library Conference Proceedings | 2013
|The Time Window Assignment Vehicle Routing Problem
British Library Online Contents | 2015
|The Time Window Assignment Vehicle Routing Problem
Online Contents | 2014
|