A local optimization-based solution to the rectangle layout problem

Journal of the Operational Research Society

Volumn 47, Issue 4, 1996, Pages 523-537

  Healy, Patrick ^a   Moll, Robert ^b  

^a UNIVERSITY OF LIMERICK   (Ireland)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Cutting stock problem; Heuristics

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION; PERTURBATION TECHNIQUES; POLYNOMIALS; PROBLEM SOLVING; RESOURCE ALLOCATION;

CUTTING STOCK PROBLEM; RECTANGLE LAYOUT PROBLEM;

OPERATIONS RESEARCH;

EID: 0030122613     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.58     Document Type: Article

References (23)

1. N. Christofides and C. Whitlock (1977) An algorithm for two-dimensional cutting problems. Opns Res. 25, 30-44.
2. P. Y. Wang (1983) Two algorithms for constrained two-dimensional cutting stock problems. Opns Res. 31, 573-586.
3. M. R. Garey and R. L. Graham (1975) Bounds on multiprocessing scheduling with resource constraints. SIAM J. Comput. 4, 187-200.
4. J. D. Ullman (1975) Complexity of sequencing problems. In Computer and Job-Shop Scheduling Theory. (E. G. Coffman, Ed.) pp 139-164. Wiley, New York.
5. D. F. Wong and C. L. Liu (1989) Floorplan design of VLSI circuits. Algorithmica. 4, 263-291.
6. H. A. Dyckhoff (1990) A typology of cutting and packing problems. Eur. J. Opl Res. 44, 145-159.
7. M. R. Garey and D. S. Johnson (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., San Francisco.
8. S. Lin and B. W. Kernighan (1973). An effective heuristic for the traveling-salesman problem. Opns Res. 21, 489-516.
9. J. L. Bentley (1990) Experiments on traveling salesman heuristics. In Proceedings of First Annual ACM-SIAM Symposium on Discrete Algorithms., pp 91-99. SIAM, Philadelphia.
10. D. S. Johnson (1990) Local optimization and the traveling salesman problem. In Proc. 17th Colloquium on Automata, Languages and Programming. (M. S. Paterson, Ed.) pp 446-461. Springer-Verlag, New York.
11. B. W. Kernighan and S. Lin (1970) An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal. 49, 291-307.
12. B. Rothfarb, H. Frank, D. M. Rosenbaum, K. Steiglitz and D. J. Kleitman (1970) Optimal design of offshore natural-gas pipeline systems. Opns Res. 18, 992-1020.
13. K. Steiglitz, P. Weiner and D. J. Kleitman (1969) The design of minimum-cost survivable networks. IEEE Trans. Cir. Theory CT-16., 455-460.
14. H. N. Psaraftis (1983) c-Interchange procedures for local search in a precedence-constrained routing problem. Eur. J. Opl Res. 13, 391-402.
15. P. Healy and R. Moll (1995) A new extension of local search applied to the dial-a-ride-problem. Eur. J. Opl Res. 83, 83-104.
16. M. W. P. Savelsbergh (1990) An efficient implementation of local search algorithms for constrained routing problems. Eur. J. Opl Res. 47, 75-85.
17. K. A. Dowsland (1993) Some experiments with simulated annealing techniques for packing problems. Eur. J. Opl Res. 68, 389-399.
18. F. P. Preparata and M. I. Shamos (1985) Computational Geometry: An Introduction. Springer-Verlag, New York.
19. P. Healy (1988) Rule-based local search in rectangle layout. Master’s thesis., University of Massachusetts, Amherst.
20. B. Chazelle (1983) The bottom-left bin-packing heuristic: An efficient implementation. IEEE Trans. Computers C-32 (8) 697-707.
21. E. M. Reingold, J. Nievergelt and N. Deo (1977) Combinatorial Algorithms: Theory and Practice., 697-707. Prentice- Hall, Englewood Cliffs, NJ.
22. J. O. Berkey and P. Y. Wang (1987) Two-dimensional finite bin-packing algorithms. J. Opl Res. Soc. 38, 423-429.
23. B. S. Baker, E. G. Coffman, Jr. and R. L. Rivest (1980) Orthogonal packings in two dimensions. SIAM J. Comput. 9, 846-855.