An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

References

• Araque J. R., Hall L. A., Magnanti T. L. Capacitated trees, capacitated routing and associated polyhedra. (1990) . Discussion Paper 9061, Center for Operations Research and Econometrics, Catholic University of Louvain, Louvain, BelgiumGoogle Scholar
• Ascheuer N., Fischetti M., Grötschel M. A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks (2000) 36:69–79Crossref, Google Scholar
• Ascheuer N., Fischetti M., Grötschel M. Solving the asymmetric traveling salesman problem with time windows by branch-and-cut. Math. Programming (2001) 90:475–506Crossref, Google Scholar
• Bard J. F., Kontoravdis G., Yu G. A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Sci. (2002) 36:250–269Link, Google Scholar
• Berkey J. O., Wang P. Y. Two-dimensional finite bin packing algorithms. J. Oper. Res. Soc. (1987) 38:423–429Crossref, Google Scholar
• Blasum U., Hochstättler W. Application of the branch-and-cut method to the vehicle routing problem. (2000) . Technical Report ZPR2000-386, ZPR, Universitat zu ICIn. http://www.zailcuni-koeln.de/paperGoogle Scholar
• Bortfeldt A., Gehring H. A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. (2000) 131:143–161Crossref, Google Scholar
• Boschetti M. A., Mingozzi A. The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 4OR (2003a) 1(1):27–42Crossref, Google Scholar
• Boschetti M. A., Mingozzi A. The two-dimensional finite bin packing problem. Part II: New lower and upper bounds. 4OR (2003b) 1(2):135–147Crossref, Google Scholar
• Chen C. S., Lee S. M., Shen Q. S. An analytical model for the container loading problem. Eur. J. Oper. Res. (1995) 80:68–76Crossref, Google Scholar
• Dell’Amico M., Martello S., Vigo D. A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Appl. Math. (2002) 118:13–24Crossref, Google Scholar
• Fekete S. P., Schepers J. New classes of fast lower bounds for bin packing problems. Math. Programming (2001) 91:11–31Crossref, Google Scholar
• Fekete S. P., Schepers J. A general framework for bounds for higher dimensional orthogonal packing problems. Math. Methods Oper. Res. (2004) 60:311–329Crossref, Google Scholar
• Fekete S. P., Schepers J., van der Veen J. An exact algorithm for higher dimensional orthogonal packing. Oper. Res. (2007) . ForthcomingLink, Google Scholar
• Fisher M. L. Optimal solution of the vehicle routing problems using k-trees. Oper. Res. (1995) 42:621–642Google Scholar
• Fukasawa R., Longo H., Lysgaard J. L., Poggi de Aragão M., Reis M., Uchoa E., Werneck F. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming (2006) 106(3):491–511Crossref, Google Scholar
• Gouveia L. A result on projection for the vehicle routing problem. Eur. J. Oper. Res. (1995) 83:610–624Crossref, Google Scholar
• Iori M. Metaheuristic algorithms for combinatorial optimization problems. (2004) . Doctoral dissertation, DEIS, University of Bologna, Bologna, ItalyGoogle Scholar
• Johnson D. S. Near-optimal bin packing algorithms. (1973) . Doctoral dissertation, MIT, Cambridge, MAGoogle Scholar
• Letchford A. N., Eglese R. W., Lysgaard J. Multistars, partial multistars and the capacitated vehicle routing problem. Math. Programming (2002) 94(1):21–40Crossref, Google Scholar
• Martello S., Vigo D. Exact solution of the two-dimensional finite bin packing problem. Management Sci. (1998) 44:388–399Link, Google Scholar
• Martello S., Pisinger D., Vigo D. The three-dimensional bin packing problem. Oper. Res. (2000) 48:256–267Link, Google Scholar
• Mole R. H., Jameson S. R. A sequential route-building algorithm employing a generalized savings criterion. Oper. Res. Quart. (1976) 27:503–511Crossref, Google Scholar
• Naddef D., Rinaldi G., Toth P., Vigo D. Branch-and-cut algorithms for the capacitated VRP. The Vehicle Routing Problem (2002) (SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA) 53–84Crossref, Google Scholar
• Pisinger D. A tree search heuristic for the container loading problem. Ricerca Operativa (1998) 28(87):31–48Google Scholar
• Pisinger D. Heuristics for the container loading problem. Eur. J. Oper. Res. (2002) 141:143–153Crossref, Google Scholar
• Pisinger D., Sigurd M. Using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem. INFORMS J. Comput. (2006) . ForthcomingGoogle Scholar
• Pisinger D., Den Boef E., Korst J., Martello S., Vigo D. A note on robot-packable and general variants of the three-dimensional bin packing problem. Oper. Res. (2005) 53:735–736Link, Google Scholar
• Reinelt G. TSPLIB—A travelling salesman problem library. ORSA J. Comput. (1991) 3:376–384Link, Google Scholar
• Scheithauer G. Algorithms for the container loading problem. Oper. Res. Proc. 1991 (1992) (Springer-Verlag, Berlin, Germany) Crossref, Google Scholar
• Scheithauer G. Equivalence and dominance for problems of optimal packing of rectangles. Ricerca Operativa (1997) 27(83):3–34Google Scholar
• Scheithauer G. LP-based bounds for the container and multi-container loading problem. Internat. Trans. Oper. Res. (1999) 6:199–213Crossref, Google Scholar
• Toth P., Vigo D., Toth P., Vigo D. An overview of vehicle routing problems. The Vehicle Routing Problem (2002a) (SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA) 1–24Crossref, Google Scholar
• Toth P., Vigo D.The Vehicle Routing Problem (2002b) (SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA) Crossref, Google Scholar
• Türkay A. Loading sequence issues in routing problems with packing constraints. (2003) . Technical report, Uludag Universitesi, Müh. Mim. Fak., Endüstryi Mühendisligi Bölümü, Bursa, TurkeyGoogle Scholar
• Xu H., Chen Z.-L., Rajagopal S., Arunapuram S. Solving a practical pickup and delivery problem. Transportation Sci. (2003) 37(3):347–364Link, Google Scholar