|
Title
|
|
|
|
A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| This paper presents an efficient and well-scalable metaheuristic for fleet size and mix vehicle routing with time windows. The suggested solution method combines the strengths of well-known threshold accepting and guided local search metaheuristics to guide a set of four local search heuristics. The computational tests were done using the benchmarks of [Liu, F.-H., & Shen, S.-Y. (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society, 50(7), 721732] and 600 new benchmark problems suggested in this paper. The results indicate that the suggested method is competitive and scales almost linearly up to instances with 1000 customers. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Expert systems with applications. - New York
|
|
|
Publication
|
|
|
|
New York
:
2009
|
|
|
ISSN
|
|
|
|
0957-4174
|
|
|
DOI
|
|
|
|
10.1016/J.ESWA.2008.10.040
|
|
|
Volume/pages
|
|
|
|
36
:4
(2009)
, p. 8460-8475
|
|
|
ISI
|
|
|
|
000264528600128
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|