Guided Local Search for the Three-Dimensional Bin-Packing Problem

References

• Aarts E. H. L., Lenstra J. K.Local Search in Combinatorial Optimization (1997) (John Wiley and Sons, Chichester, U.K) Google Scholar
• Beasley J. E. An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. (1985) 33:49–64Link, Google Scholar
• Beasley J. E. Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. (1995) 36:297–306Crossref, Google Scholar
• Bengtsson B. E. Packing rectangular pieces—A heuristic approach. Comput. J. (1982) 25:353–357Crossref, Google Scholar
• Berkey J. O., Wang P. Y. Two dimensional finite bin packing algorithms. J. Oper. Res. Soc. (1987) 38:423–429Crossref, Google Scholar
• Christofides N., Whitlock C. An algorithm for two-dimensional cutting problems. Oper. Res. (1977) 25:30–44Link, Google Scholar
• Chung F. K. R., Garey M. R., Johnson D. S. On packing two-dimensional bins. SIAM J. Algebraic and Discrete Methods (1982) 3:66–76Crossref, Google Scholar
• Coffman E. G., Garey M. R., Johnson D. S., Hochbaum D. Approximation algorithms for bin packing: A survey. Approximation Algorithms (1996) (PWS Publishing Company, Boston, MA) Google Scholar
• Corcoran A. L., Wainwright R. L. A genetic algorithm for packing in three dimensions. Proc. 1992 ACM/SIGAPP Symp. on Appl. Comput. (1992) New York:1021–1030Crossref, Google Scholar
• Dell'Amico M., Martello S. Optimal scheduling of tasks on identical parallel processors. ORSA J. on Comput. (1995) 7:191–200Link, Google Scholar
• Dowsland K. Some experiments with simulated annealing techniques for packing problems. Eur. J. Oper. Res. (1993) 68:389–399Crossref, Google Scholar
• Dyckhoff H. A typology of cutting and packing problems. Eur. J. Oper. Res. (1990) 44:145–159Crossref, Google Scholar
• Dyckhoff H., Scheithauer G., Terno J., Dell'Amico M., Maffioli F., Martello S. Cutting and packing (C&P). Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley and Sons, Chichester, U.K) Google Scholar
• Fekete S. P., Schepers J. On more-dimensional packing II: Bounds. (1997) . Technical report 97.289, Mathematisches Institut, Universität zu Köln, Köln, GermanyGoogle Scholar
• Kröger B. Guillotinable bin packing: A genetic approach. Eur. J. Oper. Res. (1995) 84:645–661Crossref, Google Scholar
• Lodi A., Martello S., Vigo D. Approximation algorithms for the oriented two-dimensional bin packing problem. Eur. J. Oper. Res. (1999a) 112:158–166Crossref, Google Scholar
• Lodi A., Martello S., Vigo D. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. on Comput. (1999b) 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
• Martello S., Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. (1990) 28:59–70Crossref, Google Scholar
• Martello S., Vigo D. Exact solution of the two-dimensional finite bin packing problem. Management Sci. (1998) 44:388–399Link, Google Scholar
• Tsang E., Voudouris C. Fast local search and guided local search and their application to British Telecom's workforce scheduling problem. Oper. Res. Lett. (1997) 20:119–127Crossref, Google Scholar
• Voudouris C. Guided local search for combinatorial optimization problems. (1997) . Ph.D. thesis, Department of Computer Science, University of Essex, Colchester, U.KGoogle Scholar
• Voudouris C. Guided local search—An illustrative example in function optimisation. BT Techn. J. (1998) 16:46–50Crossref, Google Scholar
• Voudouris C., Tsang E. Partial constraint satisfaction problems and guided local search. Proc. Practical Appl. of Constraint Techn. (PACT'96) (1996) New York:337–356Google Scholar
• Voudouris C., Tsang E. Guided local search and its application to the traveling salesman problem. Eur. J. Oper. Res. (1999) 113:469–499Crossref, Google Scholar