A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm

Journal of Global Optimization

Volumn 38, Issue 4, 2007, Pages 555-580

  Marinakis, Yannis ^a   Migdalas, Athanasios ^a   Pardalos, Panos M ^b  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

^b University of Florida   (United States)

Author keywords

Bilevel programing; Genetic Algorithm; Metaheuristics; Vehicle routing problem

Indexed keywords

COST EFFECTIVENESS; DECISION MAKING; GENETIC ALGORITHMS; GROUND VEHICLES; HEURISTIC ALGORITHMS; OPERATIONS RESEARCH; PROBLEM SOLVING;

BILEVEL PROGRAMING; METAHEURISTICS; VEHICLE ROUTING PROBLEMS;

NETWORK ROUTING;

EID: 34250896800     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-006-9094-0     Document Type: Conference Paper

References (47)

1. Baker, B.M., Ayechew, M. A.: A genetic algorithm for the vehicle routing problem. Comput. Oper. Res. 30(5), 787-800 (2003)
2. Barbarosoglu, G., Ozgur, D.: A tabu search algorithm for the vehicle routing problem. Comput. Oper. Res. 26, 255-270 (1999)
3. Berger, J., Mohamed, B.: A hybrid genetic algorithm for the capacitated vehicle routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 646-656. Chicago (2003)
4. Bodin, L., Golden, B.: Classification in vehicle routing and scheduling. Networks 11, 97-108 (1981)
5. Bodin, L., Golden, B., Assad, A., Ball, M.: The state of the art in the routing and scheduling of vehicles and crews. Comput. and Oper. Res. 10, 63-212 (1983)
6. Bullnheimer, B., Hartl, P.F., Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Ann. Oper. Res. 89, 319-328 (1999)
7. Christofides, N.: Vehicle routing. In: Lawer, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G., Shmoys, D.B. (ed.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pp. 431-448. New York (1985)
8. Cordeau, J.F., Gendreau, M., Laporte, G., Potvin, J.Y., Semet, E: A guide to vehicle routing heuristics. I Oper. Res. Soc. 53, 512-522 (2002)
9. Coy, S.P., Golden, B.L., Runger, G.G, Wasil, E.A.: Using experimental design to effective parameter settings for heuristics. J. Heuristics 7(1), 77-97 (2001)
10. Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. In: Golden, B., Bodin, L.(ed.) Proceedings of the International Workshop on Current and Future Directions in the Routing and Scheduling of Vehicles and Crews, New York (1979) Wiley, pp. 109-124.
11. Fisher, M.L.: Vehicle routing. In: Ball, M.O., Magnanti, T.L., Momma, C.L., Nemhauser, G.L. (eds.) Network Routing, Handbooks in Operations Research and Management Science, vol. 8, pp. 1-33 (1995)
12. Garfinkel, R., Nemhauser, G.: Integer Programming. J Wiley, New York (1972)
13. Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manage. Sci. 40, 1276-1290 (1994)
14. Gendreau, M., Laporte, G., Potvin, J-Y.: Vehicle routing: modern heuristics. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, (1997) Wiley, Chichester, pp. 311-336.
15. Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated VRP. In: Toth, P., Vigo. D. The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications, Philadelphia, MA SIAM, pp.129-154.
16. Golden, B.L., Assad, A.A.: Vehicle Routing: Methods and Studies. North Holland. Amsterdam (1988)
17. Golden, B.L., Wasil, E.A., Kelly, J.P., Chao, I.M.: The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics, pp. 33-56. Kluwer Academic Publishers, Boston (1998)
18. Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449-467 (2001)
19. Held, M., Karp, R.M.: The traveling salesman problem and minimum spanning trees. Oper. Res. 18, 1138-1162 (1970)
20. Laporte, O., Gendreau, M., Potvin, J.-Y, Semet, F.: Classical and modern heuristics for the vehicle routing problem. Int. Trans. Oper. Res. 7, 285-300 (2000)
21. Laporte, G., Semet, F.: Classical heuristics for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications, pp. 109-128. SIAM. Philadelphia, PA (2002)
22. Lawer, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York (1985)
23. Li, F., Golden, B., Wasil, E.: Very large-scale vehicle routing: new test problems, algorithms and results, Comput. Oper. Res. 32(5), 1165-1179 (2005)
24. Lin, S.: Computer solutions of the traveling salesman problem. Bell Sys. Tech. J. 44, 2245-2269 (1965)
25. Marinakis, Y.: Vehicle Routing in Distribution Problems. Ph. D. Thesis. Department of Production Engineering and Management, Technical University of Crete, Chania, Greece (2005)
26. Marinakis, Y., Migdalas, A.: Heuristic Solutions of Vehicle Routing Problems in Supply Chain Management. In: Pardalos, P.M., Migdalas, A., Burkard, R. (eds.) Combinatorial and Global Optimization, pp. 205-236. World Scientific Publishing Co, Singapore, (2002)
27. Marinakis, Y., Migdalas, A., Pardalos P.M.: Expanding neighborhood GRASP for the traveling salesman problem. Comput. Optim. Appl. 32, 231-257 (2005)
28. Marinakis, Y., Migdalas, A., Pardalos, P.M.: A Hybrid Genetic-GRASP algortihm using langrangean relaxation for the traveling salesman problem. J. Comb. Optim. 10, 311-326 (2005)
29. Marinakis, Y., Migdalas, A., Pardalos, P.M.: Multiple phase neighborhood search GRASP based on Lagrangian relaxation and random backtracking Lin-Kernighan for the traveling salesman problem (submitted in Optimization Methods and Software (2006))
30. Migdalas, A., Pardalos, P.: Nonlinear bilevel problems with convex second level problem-Heuristics and descent methods In: Du, D. -Z. et al., (eds.) Operations Research and its Application, pp. 194-204. World Scientific, Singapore (1995)
31. Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems. Ann. Oper. Res. 41, 421-451 (1993)
32. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31, 1985-2002 (2004)
33. Reimann, M., Stummer, M., Doerner, K.: A savings based ant system for the vehicle routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, 1317-1326. New York (2002)
34. Reimann, M., Doerner, K., Hartl, R.F.: D-Ants: savings based ants divide and conquer the vehicle routing problem. Comput. Oper. Res. 31(4), 563-591 (2004)
35. Rego, C.: A subpath ejection method for the vehicle routing problem. Manage Sci. 44, 1447-1459 (1998)
36. Rego, C.: Node-ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Comput. 27(3), 201-222 (2001)
37. Resende, M. G. C., Ribeiro, C. C.: Greedy Randomized Adaptive Search Procedures. In: pp. 219-249.Glover, F., Kochenberger, G. A. (eds.) Handbook of Metaheuristics, Kluwer Academic Publishers, Boston (2003)
38. Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147-167 (1995)
39. Taillard, E.D.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661-672 (1993)
40. Tarantilis, CD.: Solving the vehicle routing problem with adaptive memory programming methodology. Comput. Oper. Res. bf 32(9), 2309-2327 (2005)
41. Tarantilis, CD., Kiranoudis, CT., Vassiliadis, VS.: A backtracking adaptive threshold accepting metaheuristic method for the Vehicle Routing Problem. Sys. Anal. Model. Simul. (SAMS) 42(5), 631-644 (2002)
42. Tarantilis, C.D., Kiranoudis, C.T., Vassiliadis, V.S.: A list based threshold accepting algorithm for the capacitated vehicle routing problem. Int. J. Comput. Math. 79(5), 537-553 (2002)
43. Tarantilis, CD., Kiranoudis, C.T.: BoneRoute: an adaptive memory-based method for effective fleet management. Ann. Oper. Res. 115(1), 227-241 (2002)
44. Toth, P., Vigo, D.: The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications. SIAM Philadelphia, PA (2002a)
45. Toth, P., Vigo, D.: An overview of Vehicle Routing Problems. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications, pp. 1-26.SIAM, Philadelphia, MA (2002b)
46. Toth, P., Vigo, D.: The granular tabu search (and its application to the vehicle routing problem). INFORMS J. Comput. 15(4), 333-348 (2003)
47. Xu, J., Kelly, J.P.: A new network flow-based tabu search heuristic for the vehicle routing problem. Transportation Sci. 30, 379-393 (1996)