A Tabu Search Algorithm for a Routing and Container Loading Problem

References

• Baker B. S., Coffman E. G., Rivest R. L. Orthogonal packing in two dimensions. SIAM J. Comput. (1980) 9:846–855Crossref, Google Scholar
• Bortfeldt D., Gehring H. A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. (2001) 131:143–161Crossref, Google Scholar
• Christofides N., Whitlock C. An algorithm for two-dimensional cutting problems. Oper. Res. (1977) 25:30–44Link, Google Scholar
• Clarke G., Wright J. W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. (1964) 12:568–581Link, Google Scholar
• Cordeau J.-F., Laporte G., Rego C., Alidaee B. Tabu search heuristics for the vehicle routing problem. Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search (2004) (Kluwer, Boston) 145–163Google Scholar
• Cordeau J.-F., Gendreau M., Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks (1997) 30:105–119Crossref, Google Scholar
• Cordeau J.-F., Gendreau M., Hertz A., Laporte G., Sormany J.-S., Langevin A., Riopel D. New heuristics for the vehicle routing problem. Logistics Systems: Design and Optimization (2005) (Springer, New York) 279–297Crossref, Google Scholar
• Eley M. Solving container loading problems by block arrangement. Eur. J. Oper. Res. (2002) 141:393–409Crossref, Google Scholar
• Fukasawa R., Longo H., Lysgaard J. L., de Aragão M. Poggi, Reis M., Uchoa E., Werneck F. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Proc. X IPCO (2004) Vol. 3064:1–15Springer Lecture Notes in Computer Science, New YorkCrossref, Google Scholar
• Gendreau M., Hertz A., Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. (1992) 40:1086–1094Link, Google Scholar
• Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Sci. (1994) 40:1276–1290Link, Google Scholar
• Gendreau M., Iori M., Laporte G., Martello S. A tabu search approach to vehicle routing problems with two-dimensional loading constraints. Networks (2006) . ForthcomingGoogle Scholar
• Iori M., Salazar González J. J., Vigo D. An exact approach for the symmetric capacitated vehicle routing problem with two dimensional loading constraints. (2003) . Technical Report OR/03/04, DEIS, Università di Bologna, Bologna, ItalyGoogle Scholar
• Levitin K., Abezgaouz R. Optimal routing of multiple-load AGV subject to LIFO loading constraints. Comput. Oper. Res. (2003) 30:397–410Crossref, Google Scholar
• Lodi A. Multi-dimensional packing by tabu search. Studia Informatica Universalis (2002) 2:111–126Google Scholar
• Lodi A., Martello S., Vigo D. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. (1999) 11:345–357Link, Google Scholar
• Martello S., Pisinger D., Vigo D. The three-dimensional bin packing problem. Oper. Res. (2000) 48:256–267Link, Google Scholar
• Pisinger D. Heuristics for the container loading problem. Eur. J. Oper. Res. (2002) 141:382–392Crossref, Google Scholar
• Reimann M., Doerner K., Hartl R. F. D-ants: Savings based ants divide and conquer the vehicle routing problem. Comput. Oper. Res. (2004) 31:563–591Crossref, Google Scholar
• Toth P., Vigo D. SIAM Monographs on Discrete Mathematics and Applications. The Vehicle Routing Problem (2002) (Philadelphia, PA)Crossref, Google Scholar
• Xu H., Chen Z.-L., Rajagopal S., Arunapuram S. Solving a practical pickup and delivery problem. Transportation Sci. (2003) 37:347–364Link, Google Scholar