A hybrid Benders/genetic algorithm for vehicle routing and scheduling problem

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 19, Issue 1, 2012, Pages 33-46

  Lai, Ming Che ^a   Sohn, Han Suk ^b   Tseng, Tzu Liang ^c   Bricker, Dennis L ^d  

^a YU DA UNIVERSITY   (Taiwan)

^b New Mexico State University   (United States)

^c University of Texas at El Paso   (United States)

^d IA United States   (United States)

Author keywords

Benders' decomposition; Genetic algorithm; Hybrid algorithm; Lagrangian relaxation; Mixed integer programming; Vehicle routing

Indexed keywords

FLEET OPERATIONS; GENETIC ALGORITHMS; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

BENDERS' DECOMPOSITIONS; HYBRID ALGORITHMS; ITS APPLICATIONS; LAGRANGIAN RELAXATION; MIXED INTEGER PROGRAMMING; OPTIMIZATION MODELING; VEHICLE ROUTING AND SCHEDULING; VEHICLE ROUTING PROBLEMS;

INTEGER PROGRAMMING;

EID: 84861892378     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Article

References (49)

1. Dantzig, G. B. and Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1);80-91.
2. Laporte, G., Mercure, H., and Nobert, Y. (1986). An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks, 16:33-46. (Pubitemid 16488198)
3. Laporte, G. and Nobert, Y. (1987). Exact algorithms for the vehicle routing problem. Annals of Discrete Mathematics, 31:147-184.
4. Desrosiers, J., Dumas, Y., Solomon, M. M., and Soumis, F. (1995). Time constrained routing and scheduling. In Network Routing, Handbooks in Operations Research and Management Science (Ed.: Ball, M. O., Magnanti, T. L., Monma, C. L., and Nemhauser, G. L.). North-Holland, Amsterdam, pp. 35-139.
5. Hadjiconstantinou, E., Christofides, N., and Mingozzi, A. (1995). A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations. Annals of Operations Research, 61:21-43.
6. Fisher, M. L. (1994). Optimal solution of vehicle routing problems using minimum k-trees. Operations Research, 42:626-642.
7. Miller, D. L. (1995). A matching based exact algorithm for capacitated vehicle routing problems. ORSA Journal on Computing, 7:1-9.
8. Toth, P. and Vigo, D. (1997). An exact algorithm for the vehicle routing problem with backhauls. Transportation Science, 31:372-385. (Pubitemid 127601478)
9. Augerat, P., Belenguer, J. M., Benavent, E., Corberan, A., Naddef, D., and Rinaldi, G. (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report RR 949-M, Universite Joseph Fourier, Grenoble, France.
10. Blasum, U. and Hochstattler, W. (2000). Application of the branch and cut method to the vehicle routing problem. Technical Report ZPR2000-386, ZPR, Universitat zu Koln, 2000.
11. Kopman, L. (1999). A new generic separation routine and its application in a branch and cut algorithm for the capacitated vehicle routing problem. Ph. D. thesis, Cornell University, Ithaca, NY.
12. Ralphs, T. K. (1995). Parallel branch and cut for vehicle routing. Ph. D. thesis, Cornell University, Ithaca, NY.
13. Desrochers, M., Desrosiers, J., and Solomon, M. M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40:342-354.
14. Clarke G. and Wright, J. V. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12:568-581.
15. Nelson, M. D., Nygard, K. E., Griffin, J. H., and Shreve, W. E. (1985). Implementation techniques for the vehicle routing problem. Computers and Operations Research, 12:273-283.
16. Christofides, N., Mingozzi, A., and Toth, P. (1979). The vehicle routing problem. In Combinatorial Optimization (Ed.: Christofides, N., Mingozzi, A., Toth, P., and Sandi, C.). Wiley, Chichester, UK, pp 315-338.
17. Gillett, B. E., and Miller, L. R. (1974). A heuristic algorithm for the vehicle dispatch problem. Operations Research, 22:340-349.
18. Thompson, P. M. and Psaraftis, H. N. (1993). Cyclic transfer algorithms for multi-vehicle routing and scheduling problems. Operations Research, 41:935-946.
19. Osman, I. H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41:421-451.
20. Golden, B. L., Wasil, E. A., Kelly, J. P., and Chao, I. M. (1998). Metaheuristics in vehicle routing. In Fleet Management and Logistics (Ed.: Crainic, T. G and Laporte, G.). Kluwer, Boston, MA, pp. 33-56.
21. Gendreau, M., Hertz, A., and Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40:1276-1290.
22. Xu, J. and Kelly, J. P. (1996). A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science, 30:379-393. (Pubitemid 126604567)
23. Rego, C., and Roucairol, C. (1996). A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In Meta-Heuristics (Ed.: Osman, I. H. and Kelly, J. P.): Theory and Applications, Kluwer, Boston, MA, pp. 661-675.
24. Rochat, Y. and Taillard, E. D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1:147-167.
25. Tom, P. and Vigo, D. (2003). The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing, 15:333-346. (Pubitemid 39042713)
26. Barbarosoglu, G. and Ozgur, D. (1999). A tabu search algorithm for the vehicle routing problem. Computers and Operations Research, 26:255-270. (Pubitemid 29346475)
27. Thangiah, S. R. (1993). Vehicle routing with time windows using genetic algorithms. Technical Report SRU-CpSc-TR-93-23, Slippery Rock University, Slippery Rock, PA.
28. Schmitt, LJ. (1994). An empirical computational study of genetic algorithms to solve order based problems: An emphasis on TSP and VRPTC. Ph. D. dissertation, Fogelman College of Business and Economics, University of Memphis, TN.
29. Potvin, J.-Y., Duhamel, C., and Guertin, F. (1996). A genetic algorithm for vehicle routing with backhauling. Applied Intelligence, 6:345-355. (Pubitemid 126709684)
30. Kawamura, H., Yamamoto, M., Mitamura, T., Suzuki, K., and Ohuchi, A. (1998). Cooperative search on pheromone communication for vehicle routing problems. IEEE Transactions on Fundamentals, E81-A: 1089-1096. (Pubitemid 128730312)
31. Bullnheimer, B., Hartl, R. F., and Strauss, C. (1998). Applying the ant system to the vehicle routing problem. In Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (Ed.: Voss, S., Martello, S., Osman, I. H., and Roucairol, C.). Kluwer, Boston, MA, 1998, pp. 109-120.
32. Bullnheimer, B., Hartl, R. F., and Strauss, C. (1999). An improved ant system for the vehicle routing problem. Annals of Operations Research, 89:319-328.
33. Garvin, W. M., Crandall, H. W., John, J. B., and Spellman, R. A. (1957). Applications of linear programming in the oil industry. Management Science, 3:407-430.
34. Gavish, B. and Graves, S. (1979). The travelling salesman problem and related problems. Working Paper 7905, Graduate School of Management, University of Rochester, Rochester, NY.
35. Gavish, B. and Graves, S. (1982). Scheduling and routing in transportation and distributions systems: Formulations and new relaxations. Working paper, Graduate School of Management, University of Rochester, Rochester, NY.
36. Lai, M., Sohn, H., Tseng, T., and Chiang, C. (2010). A hybrid algorithm for capacitated plant location problem. Expert Systems with Applications, 37:8599-8605.
37. Benders, J. F. (1962). Partitioning Procedures for Solving Mixed-Variables Programming Problems. Numerische Mathematik, 4:238-252.
38. Cakir, O. (2009). Benders decomposition applied to multi-commodity, multi-mode distribution planning. Expert Systems with Applications, 36:8212-8217.
39. Cordeau, J.-F., Soumis, F., and Desrosiers, J. (2000). A Benders decomposition approach for the locomotive and car assignment problem. Transportation science, 34(2):133-149.
40. Cordeau, J.-F., Soumis, F., and Desrosiers, J. (2001). Simultaneous assignment of locomotives and cars to passenger trains. Operations research, 49(4):531-548. (Pubitemid 33025568)
41. Heragu, S. S. and Chen, J. (1998). Optimal solution of cellular manufacturing system design: Benders' decomposition approach. European journal of operational research, 107:175-192. (Pubitemid 128391336)
42. Kennington, J. L. and Whitler, J. E. (1999). An efficient decomposition algorithm to optimize spare capacity in a telecommunications network. INFORMS Journal on computing, 11(2):149-160.
43. Kim, H., Sohn, H., and Bricker, D. L. (2011). Generation Expansion Planning using Benders' decomposition and generalized networks. International Journal of Industrial Engineering: Theory, Applications and Practice.
44. Randazzo, C., Luna, H., and Mahey, P. (2001). Benders decomposition for local access network design with two technologies. Discrete mathematics and theoretical computer science, 4:235-246.
45. Holland, J. H. (1992). Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence Cambridge, MA: The MIT Press.
46. He, S., Chaudhry, S., and Chaudhry, P. (2003). Solving a class of facility location problems using genetic algorithms. Expert Systems, 20(2):86-91.
47. Jaramillo, J. H., Bhadury, J., and Batta, R. (2002). On the use of genetic algorithms to solve location problems. Computers & Operations Research, 29:761-779. (Pubitemid 34099416)
48. Osman, I. H., & Laporte, G. (1996). Metaheuristcs: A Bibliography. Annals of Operations Research, 63:513-623.
49. Takeshi, U., Masatoshi, S., Kosuke, K., Hideki, K., and Kazutaka, C. (2007). An Application of Genetic Algorithm for Facility Location Problem with A-distance in a Competitive Environment. Transactions of the Institute of Systems, Control and Information Engineers, 20(3):106-113.