A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
Lixin Miao; Qingfang Ruan; Kevin Woghiren; Qi Ruo
RAIRO - Operations Research (2012)
- Volume: 46, Issue: 1, page 63-82
- ISSN: 0399-0559
Access Full Article
topAbstract
topHow to cite
topReferences
top- B. Andreas, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Comput. Oper. Res.39 (2012) 2248–2257.
- B.M. Baker and M.A. Ayechew, A genetic algorithm for the vehicle routing problem. Comput. Oper. Res.30 (2003) 787–800.
- B.S. Baker, E.G. CoffmanJr., and R.L. Rivest, Orthogonal packings in two dimensions. SIAM J. Comput.9 (1980) 846–855.
- A. Bortfeldt and H. Gehring, A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res.131 (2001) 143–161.
- J. Cordeau and G. Laporte, Tabu search heuristics for the vehicle routing problem. Metaheuristic Optimization via Memory and Evolution30 (2005) 145–163.
- J. Cordeau, M. Gendreau, A. Hertz, G. Laporte and J. Sormany, New heuristics for the vehicle routing problem. Logistics Systems : Design and Optimization (2005) 279–297.
- T.G Crainic, G. Perboli and R. Tadei, Extreme point-based heuristics for three-dimensional bin packing. Informs J. Comput.20 (2008) 368–384.
- T.G. Crainic, G. Perboli and R. Tadei, TS2PACK : A two-level tabu search for the three-dimensional bin packing problem. Eur. J. Oper. Res.195 (2009) 744–760.
- K.F. Doerner, G. Fuellerer, R.F. Hartl, M. Gronalt, and M. Iori, Metaheuristics for the vehicle routing problem with loading constraints. Networks49 (2007) 294–307.
- C. Duhamel, P. Lacomme, A. Quilliot and H. Toussaint, A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Comput. Oper. Res.38 (2011) 617–640.
- M. Eley, Solving container loading problems by block arrangement. Eur. J. Oper. Res.141 (2002) 393–409.
- O. Faroe, D. Pisinger and M. Zachariasen, Guided local search for the three-dimensional bin-packing problem. Informs J. Comput.15 (2003) 267–283.
- G. Fuellerer, K.F. Doerner, R.F. Hartl and M. Iori, Ant colony optimization for the two-dimensional loading vehicle routing problem. Comput. Oper. Res.36 (2009) 655–673.
- G. Fuellerer, K.F. Doerner, R.F. Hartl and M. Iori, Metaheuristics for vehicle routing problems with three-dimensional loading constraints. Eur. J. Oper. Res.201 (2010) 751–759.
- R. Fukasawa, H. Longo, J. Lysgaard, M.P.D. Aragão, M. Reis, E. Uchoa and R.F. Werneck, Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program.106 (2006) 491–511.
- M. Gendreau, M. Iori, G. Laporte and S. Martello, A tabu search algorithm for a routing and container loading problem. Trans. Sci.40 (2006) 342–350.
- M. Gendreau, M. Iori, G. Laporte and S. Martello, A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks51 (2008) 4–18.
- B.E. Gillett and R.M. Leland, A heuristic algorithm for the vehicle-dispatch problem. Oper. Res.22 (1974) 340–349.
- M. Iori, Metaheuristic algorithms for combinatorial optimization problems. Ph.D. thesis, Italy (2004).
- M. Iori, Metaheuristic algorithms for combinatorial optimization problems. Quart. J. Oper. Res.3 (2005) 163–166.
- M. Iori and S. Martello, Routing problems with loading constraints. TOP18 (2010) 4–27.
- M. Iori, J.J. Salazar-Gonzalez and D. Vigo, An exact approach for the vehicle routing problem with two-dimensional loading constraints. Trans. Sci.41 (2007) 253–264.
- L. Junqueira, R. Morabito and D. SatoYamashita, Three-dimensional container loading models with cargo stability and load bearing constraints. Comput. Oper. Res.39 (2012) 74–85.
- S. Khebbache-Hadji, C. Prins, A. Yalaoui and M. Reghioui, Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows. Cent. Eur. J. Oper. Res. (in press) 1–30.
- G. Levitin and R. Abezgaouz, Optimal routing of multiple-load AGV subject to LIFO loading constraints. Comput. Oper. Res.30 (2003) 397–410.
- A. Lodi, S. Martello and D. Vigo, Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. Informs J. Comput.11 (1999) 345–357.
- S. Martello, D. Pisinger and D. Vigo, The three-dimensional bin packing problem. Oper. Res.48 (2000) 256–267.
- S. Martello, D. Pisinger, D. Vigo, E. Den Boef, and J. Korst, Algorithm 864 : general and robot-packable variants of the three-dimensional bin packing problem. ACM Trans. Math. Softw.33 (2007) 7–17.
- F. Pereira, J. Tavares, P. Machado and E. Costa, GVR : a new genetic representation for the vehicle routing problem. Artificial Intelligence and Cognitive Science24 (2002) 95–102.
- D. Pisinger, Heuristics for the container loading problem. Eur. J. Oper. Res.141 (2002) 382–392.
- M. Reimann, K. Doerner and R.F. Hartl, D-Ants : Savings based ants divide and conquer the vehicle routing problem. Comput. Oper. Res.31 (2004) 563–591.
- Q. Ruan, Z. Zhang, L. Miao and H. Shen, A hybrid approach for the vehicle routing problem with three-dimensional loading constraints. Comput. Oper. Res. (in press).
- C.D. Tarantilis, E.E. Zachariadis and C.T. Kiranoudis, A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Trans. Intell. Transp. Syst.10 (2009) 255–271.
- P. Toth and D. Vigo, The vehicle routing problem, in SIAM Monographs on Discrete Mathematics and Applications. Philadelphia (2002).
- F. Tricoire, K. Doerner, R. Hartl and M. Iori, Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR-Spectrum33 (2011) 931–959.
- H. Xu, Z. Chen, S. Rajagopal and S. Arunapuram, Solving a practical pickup and delivery problem. Trans. Sci.37 (2003) 347–364.
- T. Yi and W. Fan, A New packing heuristic based algorithm for vehicle routing problem with three-dimensional loading constraints, in IEEE Int. Conf. Automation Science and Engineering (CASE) (2010) 972–977.
- E.E. Zachariadis, C.D. Tarantilis and C.T. Kiranoudis, A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res.195 (2009) 729–743.