TY - JOUR
T1 - A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows
AU - Bräysy, Olli
AU - Porkka, Pasi P.
AU - Dullaert, Wout
AU - Repoussis, Panagiotis P.
AU - Tarantilis, Christos D.
PY - 2009/5
Y1 - 2009/5
N2 - 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), 721-732] 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.
AB - 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), 721-732] 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.
KW - Heterogeneous vehicles
KW - Metaheuristics
KW - Vehicle routing
UR - http://www.scopus.com/inward/record.url?scp=60549106004&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=60549106004&partnerID=8YFLogxK
U2 - 10.1016/j.eswa.2008.10.040
DO - 10.1016/j.eswa.2008.10.040
M3 - Article
AN - SCOPUS:60549106004
SN - 0957-4174
VL - 36
SP - 8460
EP - 8475
JO - Expert Systems with Applications
JF - Expert Systems with Applications
IS - 4
ER -