A Review on the Bin Packing Capacitated Vehicle Routing Problem

This paper introduced the Bin Packing Capacitated Vehicle Routing Problem. It introduced the constraints and differences between algorithms of two-dimensional and three-dimensional loading capacitated vehicle routing problem. It gave a review of models and algorithms for Bin Packing Capacitated VRP. Finally, it prospected future research orientations and possible improvement in this area.

[1]  Guenther Fuellerer,et al.  Ant colony optimization for the two-dimensional loading vehicle routing problem , 2009, Comput. Oper. Res..

[2]  Xuan Hui-yu.  Summarizing Research on Models and Algorithms for Vehicle Routing Problem , 2005 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Emmanouil E. Zachariadis,et al.  A Hybrid Metaheuristic Algorithm for the Integrated Vehicle Routing and Three-Dimensional Container-Loading Problem , 2009, IEEE Transactions on Intelligent Transportation Systems.

[5]  Andreas Bortfeldt,et al.  A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints , 2012, Comput. Oper. Res..

[6]  Stephen C. H. Leung,et al.  Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem , 2011, Comput. Oper. Res..

[7]  Manuel Iori,et al.  Metaheuristic algorithms for combinatorial optimization problems , 2005, 4OR.

[8]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[9]  Emmanouil E. Zachariadis,et al.  A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints , 2009, Eur. J. Oper. Res..

[10]  Daniele Vigo,et al.  An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints , 2007, Transp. Sci..

[11]  Ma Liang.  Three-dimensional bin-packing algorithm for urban logistic distribution , 2009 .

[12]  J. Hartmanis.  Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson) , 1982 .

[13]  Wang Zheng.  Vehicle routing problem in distribution with two-dimensional loading constraint , 2011 .

[14]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[15]  Michel Gendreau,et al.  A Tabu Search Algorithm for a Routing and Container Loading Problem , 2006, Transp. Sci..

[16]  Zheng Yong-qian.  Modeling and relization of cross-docking logistics system , 2009 .

[17]  Philippe Lacomme,et al.  A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem , 2011, Comput. Oper. Res..

[18]  Guenther Fuellerer,et al.  Metaheuristics for vehicle routing problems with three-dimensional loading constraints , 2010, Eur. J. Oper. Res..

[19]  Lixin Miao,et al.  A hybrid approach for the vehicle routing problem with three-dimensional loading constraints , 2013, Comput. Oper. Res..