Can I read A Well-scalable Metaheuristic for the Fleet Size and Mix Vehicle Routing Problem with Time Windows on EtoBox?

A Well-scalable Metaheuristic for the Fleet Size and Mix Vehicle Routing Problem with Time Windows by Olli Bräysy; Pasi P. Porkka; Wout Dullaert; Panagiotis P. Repoussis; Christos D. Tarantilis is a Computer Science article available to read on EtoBox.

What is A Well-scalable Metaheuristic for the Fleet Size and Mix Vehicle Routing Problem with Time Windows about?

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.

Who reads A Well-scalable Metaheuristic for the Fleet Size and Mix Vehicle Routing Problem with Time Windows?

Author

Olli Bräysy; Pasi P. Porkka; Wout Dullaert; Panagiotis P. Repoussis; Christos D. Tarantilis

Publisher

Elsevier Science; Elsevier ; Elsevier Ltd.; Elsevier BV (ISSN 0957-4174)

Published

2009

Language

EN

Field

Computer Science (Physical Sciences)