Solving the vehicle routing problem by a hybrid meta-heuristic algorithm

Majid Yousefikhoshbakht1, Esmaile Khorram2
1Young Researchers Club, Hamedan Branch, Islamic Azad University, Hamedan, Iran
2Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Hafez Avenue, Tehran, Iran

Tóm tắt

Từ khóa


Tài liệu tham khảo

Ai J, Kachitvichyanukul V: Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput Ind Eng 2009, 56: 380–387. 10.1016/j.cie.2008.06.012

Baker BM, Ayechew MA: A genetic algorithm for the vehicle routing problem. Comput Oper Res 2003, 30: 787–800. 10.1016/S0305-0548(02)00051-5

Bodin L, Golden B: Classification in vehicle routing and scheduling. Networks 1981, 11: 97–108. 10.1002/net.3230110204

Bullnheimer B, Hartl RF, Strauss C: Applying the ant system to the vehicle routing problem. In Meta-heuristics: advances and trends in local search paradigms for optimization. Edited by: Voss S, Martello S, Osman IH, Roucairol C. Kluwer, Boston; 1998.

Bullnheimer B, Hartl RF, Strauss C: An improved ant system algorithm for the vehicle routing problem. Ann Oper Res 1999, 89: 319–328.

Choi E, Tcha DW: A column generation approach to the heterogeneous fleet vehicle routing problem. Comput Oper Res 2007,34(7):2080–2095. 10.1016/j.cor.2005.08.002

Christofides N, Mingozzi A, Toth P: The vehicle routing problem. Combinatorial optimization. Chichester, Wiley; 1979:315–338.

Clark G, Wright JW: Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 1964, 12: 568–581. 10.1287/opre.12.4.568

Clarke G, Wright JW: Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 1964, 12: 568–581. 10.1287/opre.12.4.568

DEIS - Operations Research Group: Library of Instances. 2012. http://www.or.deis.unibo.it/research_Pages/ORinstances/VRPLIB/VRPLIB.html

Dorigo M PhD thesis, Dipartimento di Elettronica. In Optimization, learning and natural algorithms (in Italian). Politecnico di Milano, Italy; 1992:p 140.

Dorigo M, Ganbardella L: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolutionary, Computing; 1997:53–66.

Dorigo M, Maniezzo V, Colorni A: Positive feedback as a search strategy, Technical Report 91–106. Dipartimento di Elettronica, Politecnico di Milano, Italy; 1991.

Gillett BE, Miller LR: A heuristic algorithm for the vehicle dispatch problem. Oper Res 1974, 22: 340–349. 10.1287/opre.22.2.340

Hong L: An improved LNS algorithm for real-time vehicle routing problem with time windows. Comput Oper Res 2012,39(2):151–163. 10.1016/j.cor.2011.03.006

Lee ZJ, Su F, Lee CF: Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics. IEEE Transactions on Systems, Man and Cyberkinetics, Part B 2003, 33: 121–133. 10.1109/TSMCA.2003.812599

Leung SCH, Zhou X, Zhang D, Zheng J: Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Comput Oper Res 2011,38(1):205–215. 10.1016/j.cor.2010.04.013

Lima CMRR, Goldberg MC, Goldberg EFG: A memetic algorithm for the heterogeneous fleet vehicle routing problem. Electronic Notes in Discrete Mathematics 2004, 18: 171–176.

Lin SW, Lee ZJ, Ying KC, Lee CY: Applying hybrid meta-heuristics for capacitated vehicle routing problem. Expert Syst Appl 2009, 36: 1505–1512. 10.1016/j.eswa.2007.11.060

Mazzeo S, Loiseau I: An ant colony algorithm for the capacitated vehicle routing problem. Electronic Notes in Discrete Mathematics 2004, 18: 181–186.

Ngueveu SU, Prins C, Wolfler-Calvo R: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput Oper Res 2010, 37: 1877–1885. 10.1016/j.cor.2009.06.014

Osman LH: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 1993, 41: 421–451. 10.1007/BF02023004

Pisinger D, Ropke S: Large neighborhood search. In Handbook of metaheuristics of International series in operations research & management science. 146th edition. Edited by: Gendreau M, Potvin J-Y. Springer, New York; 2010:399–419.

Potvin JY, Dube D, Robillard C: A hybrid approach to vehicle routing using neural networks and genetic algorithms. Appl Intell 1996, 6: 241–252. 10.1007/BF00126629

Potvin JY, Duhamel C, Guertin F: A genetic algorithm for vehicle routing with backhauling. Appl Intell 1996, 6: 345–355. 10.1007/BF00132738

Prins C: Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng Appl Artif Intel 2009, 22: 916–928. 10.1016/j.engappai.2008.10.006

Reimann M, Shtovba S, Nepomuceno E: A hybrid ACO-GA approach to solve Vehicle Routing Problems. Student Papers of the Complex Systems Summer School, Santa Fe Institute, Budapest; 2001.

Ruiz R, Maroto C, Alcaraz J: A decision support system for a real vehicle routing problem. Eur J Oper Res 2004,153(3):593–606. 10.1016/S0377-2217(03)00265-0

Su CT, Chen HH: Vehicle routing design of physical distribution center. Journal of the Chinese Institute of Industrial Engineers 1999,16(3):405–417. 10.1080/10170669.1999.10432667

Taillard E: Parallel iterative search methods for vehicle routing problems. Networks 1993,23(8):661–673. 10.1002/net.3230230804

Valle CA, Martinez LC, Cunha AS, Mateus GR: Heuristic and exact algorithms for a min–max selective vehicle routing problem. Comput Oper Res 2011,38(7):1054–1065. 10.1016/j.cor.2010.10.010

Wang CH, Lu JZ: A hybrid genetic algorithm that optimizes capacitated vehicle routing problems. Expert Syst Appl 2009, 36: 2921–2936. 10.1016/j.eswa.2008.01.072

Zhang X, Tang L: A new hybrid ant colony optimization algorithm for the vehicle routing problem. Pattern Recognit Lett 2009, 30: 848–855. 10.1016/j.patrec.2008.06.001