Heuristic approaches for the fleet size and mix vehicle routing problem with time windows

Transportation Science

Volumn 41, Issue 4, 2007, Pages 516-526

  Dell'amico, Mauro ^a   Monaci, Michele ^b   Pagani, Corrado ^a   Vigo, Daniele ^c  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Heterogeneous fleet; Metaheuristics; Time windows; Vehicle routing problem

Indexed keywords

BENCHMARKING; HEURISTIC METHODS; VEHICLE ROUTING; VEHICLES;

COMPUTATIONAL EXPERIMENT; HETEROGENEOUS FLEET; HETEROGENEOUS VEHICLES; META HEURISTIC ALGORITHM; META HEURISTICS; TIME WINDOWS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

FLEET OPERATIONS;

EID: 70449652437     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1070.0190     Document Type: Article

References (17)

1. Christofides, N., A. Mingozzi, P. Toth. 1979. The vehicle routing problem. N. Christofides, A. Mingozzi, P. Toth, C. Sandi, eds. Combinatorial Optimization. John Wiley &Sons, Chichester, UK, 315-338.
2. Clarke, G., J. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery point. Oper. Res. 12 568-581.
3. Dongarra, J. J. 2006. Performance of various computers using standard linear equations software. Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN.
4. Dullaert, W., G. K. Janssens, K. Sorensen, B. Vernimmen. 2002. New heuristics for the fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. 53 1232-1238.
5. Fisher, M. L., R. Jaikumar. 1981. A generalized assignment heuristic for the vehicle routing problem. Networks 11 109-124.
6. Golden, B., A. Assad, L. Levy, F. Gheysens. 1984. The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11 49-66.
7. Liu, F. H., S. Y. Shen. 1999. The fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. 50 721-732.
8. Lodi, A., S. Martello, D. Vigo. 1999. Heuristic and meta-heuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. 11 345-357.
9. Pisinger, D., S. Ropke. 2007. A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8)2403-2435.
10. Potvin, J. Y., J. M. Rousseau. 1993. A parallel route building algorithm for the vehicle routing scheduling problem with time windows. Eur. J. Oper. Res. 66 331-340.
11. Renaud, J., F. Boctor. 2002. A sweep-based algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. 140 618-628.
12. Ropke, S., D. Pisinger. 2007. A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171 750-775.
13. Savelsbergh, M. W. P. 1992. Computer Aided Routing. CWI Tract 75, Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands.
14. Schrimpf, G., J. Schneider, H. Stamm-Wilmbrandt, G. Dueck. 2000. Record breaking optimization results using the ruin and recreate principle. J. Computational Phys. 159 139-171.
15. Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. Principles and Practice of Constraint Programming-CP98, Vol. 1520. Lecture Notes in Computer Science. Springer, New York, 417-431.
16. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problems with time windows constraints. Oper. Res. 35 254-265.
17. Toth, P., D. Vigo. 2002. The Vehicle Routing Problem. Society for Industrial and Applied Mathematic Monographs on Discrete Mathematics and Applications, Philadelphia, PA.