A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows

Authors:
Olli Bräysy;Pasi P. Porkka;Wout Dullaert;Panagiotis P. Repoussis;Christos D. Tarantilis
Affiliations:
Agora Innoroad Laboratory, Agora Center, P.O. Box 35, FI-40014 University of Jyväskylä, Finland;Helsinki School of Economics, Logistics, P.O. Box 1210, FIN-00101 Helsinki, Finland;Institute of Transport and Maritime Management Antwerp, University of Antwerp, Keizerstraat 64, B-2000 Antwerp, Belgium and Antwerp Maritime Academy, Noordkasteel Oost 6, 2030 Antwerpen, Belgium;Athens University of Economics and Business, Evelpidon 47A and Leukados 33,11362, Athens, Greece;Athens University of Economics and Business, Evelpidon 47A and Leukados 33,11362, Athens, Greece
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 9
Cited 5

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows

INFORMS Journal on Computing
Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems

Transportation Science
Designing And Managing The Supply Chain

Designing And Managing The Supply Chain
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem

Computers and Operations Research
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems

Computers and Operations Research
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows

Journal of Heuristics

Review: Industrial aspects and literature survey: Fleet composition and routing

Computers and Operations Research
Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm

Expert Systems with Applications: An International Journal
Vehicle routing problem with time windows considering overtime and outsourcing vehicles

Expert Systems with Applications: An International Journal
Survey of Green Vehicle Routing Problem: Past and future trends

Expert Systems with Applications: An International Journal
Vehicle routing problem with a heterogeneous fleet and time windows

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.06

Visualization

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), 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.