A New Capacitated Vehicle Routing Problem with Split Service for Minimizing Fleet Cost by Simulated Annealing

Journal of the Franklin Institute

Volumn 344, Issue 5, 2007, Pages 406-425

  Tavakkoli Moghaddam, R ^a   Safaei, N ^b   Kah, M M O ^c   Rabbani, M ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

^b IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

^c AMERICAN UNIVERSITY OF NIGERIA   (Nigeria)

Author keywords

Mix integer programming; Simulated annealing; Split services; Vehicle routing problem

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MOTOR TRANSPORTATION; SIMULATED ANNEALING;

CAPACITY UTILIZATION; MIX INTEGER PROGRAMMING; SPLIT SERVICES; VEHICLE ROUTING PROBLEM;

VEHICLE ROUTING;

EID: 34248995958     PISSN: 00160032     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jfranklin.2005.12.002     Document Type: Article

References (24)

1. Bramel J., and Simchi-Levi D. A location based heuristic for general routing problem. Oper. Res. 43 (1995) 649-660
2. Laporte G., Gendreau M., Potvin J.Y., and Semet F. Classical and modern heuristics for the vehicle routing problem. Int. Trans. Oper. Res. 7 (2000) 285-300
3. Gendreau M., Laporte G., Musaraganyi C., and Taillard E.D. A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Compu. Oper. Res. 26 (1999) 1153-1173
4. Taillard E.D. A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33 1 (1999) 1-14
5. Tarantilis C.D., Kiranoudis C.T., and Vassiliadis V.S. A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eu. J. Oper. Res. 152 (2004) 148-158
6. Chiang W.C., and Russell R. Simulated annealing meta-heuristics for the vehicle routing problem with time windows. An. Oper. Res. 93 (1996) 3-27
7. Doerner K.F., Gronalt M., Hartl R.F., Reimann M., Strauss C., and Stummer M. Savings ants for the vehicle routing problem. In: Cagnoni S., et al. (Ed). Applications of Evolutionary Computing (2002), Springer, Berlin
8. Dueck G., and Scheuer T. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Compu. Phys. 90 1 (1990) 161-175
9. Fisher M.L. Optimal solution of vehicle routing problems using minimum K-trees. Oper. Res. 42 (1994) 626-642
10. Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Manag. Sci. 40 (1994) 1276-1290
11. Gendreau M., Laporte G., Musaraganyi C., and Taillard E.D. A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Compu. Oper. Res. 26 (1999) 1153-1173
12. Gendreau M., Laporte G., and Potvin J.Y. Local search algorithms for the vehicle routing problem. In: Lenstra J.K., and Aarts E.H.L. (Eds). Local Search Algorithms (1995), Wiley, Chichester
13. Golden B., Laporte G., and Taillard E. An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Compu. Oper. Res. 24 (1999) 445-452
14. Kirkpatrick S., Gelatt J.R., and Vecchi M. Optimization by simulated annealing. Science 220 (1983) 671-680
15. Koulamas C., Antony S., and Jaen R. A survey of simulated annealing applications to operations research problems. Omega 22 1 (1994) 41-56
16. Lenstra J.K., and Rinnooy Kan A. Complexity of vehicle routing and scheduling problems. Networks 11 (1981) 221-227
17. Taillard E.D. A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33 1 (1999) 1-4
18. R. Tavakkoli-Moghaddam, N. Safaei, Y. Gholipour, A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length, Appl. Math. Computation, in press, doi:10.1016/j.amc.2005.09.040.
19. J.K. Potvin, S. Bengio, A genetic approach to the vehicle routing problem with time windows, Publication CRT-953, Centre de recherche sur les transports, University of Montreal, 1994.
20. Reimann M., Stummer M., and Doerner K. A savings based ant system for the vehicle routing problem. In: Langdon W.B., et al. (Ed). Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002) (2002), San Francisco
21. Semet F., and Taillard E.D. Solving real-life vehicle routing problems efficiently using taboo search. An. Oper. Res. 41 (1993) 469-488
22. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M., and Puget J.E. (Eds). Principles and practice of constraint programming-Proceedings of the Fourth International Conference, Pisa, Italy (1998), Springer, Berlin 417-431
23. Tarantilis C.D., Kiranoudis C.T., and Vassiliadis V.S. A backtracking adaptive threshold accepting meta-heuristic method for the vehicle routing problem. Systems Analysis Modeling Simulation 42 5 (1994) 631-664
24. Tarantilis C.D., Kiranoudis V.S., and Vassiliadis V.S. A threshold accepting meta-heuristic for the heterogeneous fixed fleet vehicle routing problem. Eur. J. Oper. Res. 152 (2004) 148-158