Paper Info
Title
Vehicle routing problem with a heterogeneous fleet and time windows
Abstract
In this paper, a problem variant of the vehicle routing problem with time windows is introduced to consider vehicle routing with a heterogeneous fleet, a limited number of vehicles and time windows. A method that extends an existing tabu search procedure to solve the problem is then proposed. To evaluate the performance of the proposed method, experiments are conducted on a large set of test cases, which comprises several benchmark problems from numerous problem variants of the vehicle routing problem with a heterogeneous fleet. It is observed that the proposed method can be used to give reasonably good results for these problem variants. In addition, some ideas are presented to advance the research in heuristics, such as fair reporting standards, publication of benchmark problems and executable routines developed for algorithmic comparison.
Year
DOI
Venue
2014
10.1016/j.eswa.2013.11.029
Expert Syst. Appl.
Keywords
Field
DocType
algorithmic comparison,heterogeneous fleet,numerous problem variant,executable routine,existing tabu search procedure,vehicle routing,time windows,problem variant,benchmark problem,heuristics
Data mining,Vehicle routing problem,Static routing,Computer science,Operations research,Destination-Sequenced Distance Vector routing,Heuristics,Test case,Tabu search,Distributed computing,Executable
Journal
Volume
Issue
ISSN
41
8
0957-4174
Citations 
PageRank 
References 
13
0.51
21
Authors
4
Name
Order
Citations
PageRank
Jun Jiang1191.93
Kien Ming Ng212612.14
Kim Leng Poh3627.36
Kwong Meng Teo41258.52