An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows

Transportation Science

Volumn 42, Issue 3, 2008, Pages 371-386

  Bräysy, Olli ^a   Dullaert, Wout ^b   Hasle, Geir ^c   Mester, David ^d   Gendreau, Michel ^e  

^a UNIVERSITY OF JYVÄSKYLÄ   (Finland)

^b UNIVERSITY OF ANTWERP   (Belgium)

^c SINTEF ICT   (Norway)

^d UNIVERSITY OF HAIFA   (Israel)

^e UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Fleet dimensioning; Heterogeneous fleet; Neighborhood search; Time windows; Vehicle routing

Indexed keywords

ANNEALING; BENCHMARKING; INTEGER PROGRAMMING; LOCAL SEARCH (OPTIMIZATION); OPTIMIZATION; RAPID THERMAL ANNEALING; VEHICLE ROUTING; VEHICLES;

DIVERSIFICATION STRATEGIES; FLEET DIMENSIONING; HETEROGENEOUS FLEET; IMPLEMENTATION STRATEGIES; MIXED INTEGER LINEAR PROGRAM; NEIGHBORHOOD SEARCH; TIME WINDOWS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

FLEET OPERATIONS;

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

References (35)

1. Aarts, E., H. Korst, P. Van Laarhoven. 1997. Simulated annealing. E. Aarts, J. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester, UK, 91-120.
2. Bazaraa, M. S., J. J. Jarvis, H. D. Sherali. 2005. Linear Programming and Network Flows, 3rd ed. John Wiley & Sons, New York.
3. Berger, J., M. Barkaoui, O. Bräysy. 2003. A route-directed hybrid genetic approach for the vehicle routing problem with time windows. INFOR 41 179-194.
4. Bräysy, O. 2003. A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J. Comput. 15 347-368. (Pubitemid 39042714)
5. Bräysy, O., M. Gendreau. 2005a. Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Sci. 39 104-118.
6. Bräysy, O., M. Gendreau. 2005b. Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Sci. 39 119-139.
7. Bräysy, O., G. Hasle, W. Dullaert. 2004. A multi-start local search algorithm for the vehicle routing problem with time windows. Eur. J. Oper. Res. 159 586-605.
8. Bräysy, O., M. Gendreau, G. Hasle, A. Løkketangen. 2007a. A survey of heuristics for the vehicle routing problem, part I: Basic problems and supply side extensions. Working paper, SINTEF ICT, Trondheim, Norway.
9. Bräysy, O., M. Gendreau, G. Hasle, A. Løkketangen. 2007b. A survey of heuristics for the vehicle routing problem, Part II: Demand side extensions. Working paper, SINTEF ICT, Trondheim, Norway.
10. Calvete, H. I., C. Galé, M.-J. Oliveros, B. Sánchez- Valverde. 2007. A goal programming approach to vehicle routing problems with soft time windows. Eur. J. Oper. Res. 177 1720-1733.
11. Campbell, A. M., M. Savelsbergh. 2004. Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Sci. 38 369-378.
12. Clarke, G., J. W. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12 568-581.
13. Cordeau, J.-F., G. Desaulniers, J. Desrosiers, M. M. Solomon, F. Soumis. 2001. VRP with time windows. P. Toth, D. Vigo, eds. The Vehicle Routing Problem. SIAM, Philadelphia, 157-193.
14. Dell'Amico, M., M. Monaci, C. Pagani, D. Vigo. 2007. Heuristic approaches for the fleet size and mix vehicle routing problem with time windows. Transportation Sci. 41 516-526.
15. Dondo, R., J. Cerdá. 2007. A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Oper. Res. 176 1478-1507.
16. Dongarra, J. 2006. Performance of various computers using standard linear equations software. Technical Report CS-89-85, Department of Computer Science, University of Tennessee, Knoxville, TN, 97.
17. Dueck, G. 1993. New optimization heuristics: The great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104 86-92.
18. Dueck, G., T. Scheurer. 1990. Threshold accepting: A general purpose optimization algorithm. J. Comput. Phys. 90 161-175.
19. Dullaert, W., G. K. Janssens, K. Sörensen, B. Vernimmen. 2002. New heuristics for the fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. 53 1232-1238.
20. Golden, B., A. Assad, L. Levy, F. Gheysens. 1984. The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11 49-66.
21. Lee, Y. H., J. I. Kim, K. H. Kang, K. H. Kim. 2006. A heuristic for vehicle fleet mix problem using tabu search and set partitioning. Working paper, Yonsei University, Seoul, Korea.
22. 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.
23. Or, I. 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Unpublished doctoral dissertation, Northwestern University, Evanston, IL.
24. Osman, I. H., S. Salhi. 1996. Local search strategies for the vehicle fleet mix problem. V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, G. D. Smith, eds. Modern Heuristic Search Methods. John Wiley & Sons, Chichester, UK, 131-153.
25. Pisinger, D., S. Røpke. 2007. A general heuristic for vehicle routing problems. Comput. Oper. Res. 34 2403-2435.
26. Privé, J., J. Renaud, F. F. Boctor, G. Laporte. 2006. Solving a vehicle routing problem arising in soft drink distribution. J. Oper. Res. Soc. 57 1046-1052.
27. Salhi, S., G. Rand. 1993. Incorporating vehicle routing into the vehicle fleet composition problem. Eur. J. Oper. Res. 66 313-360.
28. Schellewald, C., S. Roth, C. Schnörr. 2007. Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views. Image Vision Comput. 25 1301-1314.
29. Schrimpf, G., J. Schneider, H. Stamm-Wilbrandt, G. Dueck. 2000. Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159 139-171.
30. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35 254-265.
31. Taillard, E., P. Badeau, M. Gendreau, F. Guertin, J.-Y. Potvin. 1997. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Sci. 31 170-186. (Pubitemid 127597092)
32. Tavakkoli-Moghaddam, R., N. Safaei, Y. Gholipour. 2006. A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Appl. Math. Comput. 176 445-454.
33. Toth, P., D. Vigo, eds. 2001. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia.
34. Tsuchiya, K., T. Nishiyama, K. Tsujita. 2001. A deterministic annealing algorithm for a combinatorial optimization problem using replicator equations. Physica D: Nonlinear Phenomena 149 161-173.
35. Yagiura, M., T. Ibaraki. 2001. On metaheuristic algorithms for combinatorial optimization problems. Systems Comput. Japan 32 33-55.