Hostname: page-component-8448b6f56d-42gr6 Total loading time: 0 Render date: 2024-04-18T11:06:16.241Z Has data issue: false hasContentIssue false
  • English
  • Français

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

Published online by Cambridge University Press:  15 May 2012

Lixin Miao ,
Qingfang Ruan ,
Kevin Woghiren  and
Qi Ruo
Lixin Miao
Affiliation:
Research Center for Modern Logistics, Graduate School at Shenzhen, Tsinghua University, 518055 Shenzhen, P.R. China. miaolx@sz.tsinghua.edu.cn, rqf09@mails.tsinghua.edu.cn, luoqi0601@gmail.com
Qingfang Ruan
Affiliation:
Research Center for Modern Logistics, Graduate School at Shenzhen, Tsinghua University, 518055 Shenzhen, P.R. China. miaolx@sz.tsinghua.edu.cn, rqf09@mails.tsinghua.edu.cn, luoqi0601@gmail.com
Kevin Woghiren
Affiliation:
HSBC Business School, Graduate School at Shenzhen, Peking University, 518055 Shenzhen, P.R. China; Kwoghiren@gmail.com
Qi Ruo
Affiliation:
Research Center for Modern Logistics, Graduate School at Shenzhen, Tsinghua University, 518055 Shenzhen, P.R. China. miaolx@sz.tsinghua.edu.cn, rqf09@mails.tsinghua.edu.cn, luoqi0601@gmail.com
Get access

Abstract

This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a central depot. In spite of its clear practical significance in the real world of distribution management, 3L-CVRP in literature is very limited for its high combinatorial complexity. We solve this problem by a hybrid approach which combines Genetic Algorithm and Tabu Search (GATS). Genetic algorithm is developed for vehicle routing and tabu search for three-dimensional loading, while these two algorithms are integrated for the combinatorial problem. We computationally evaluate this hybrid genetic algorithm on all publicly available test instances, and obtain new best solutions for several instances.

Keywords

Vehicle routingthree-dimensional loadinggenetic algorithmtabu search
Type
Research Article
Information
RAIRO - Operations Research , Volume 46 , Issue 1 , January 2012 , pp. 63 - 82
Copyright
© EDP Sciences, ROADEF, SMAI, 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

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