Genetic algorithm for a 2D industrial packing problem

Computers and Industrial Engineering

Volumn 37, Issue 1, 1999, Pages 375-378

  Hopper, E ^a   Turton, B ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; HEURISTIC PROGRAMMING; INDUSTRY; OPTIMIZATION; RANDOM PROCESSES;

COMBINATORIAL OPTIMISATION; NESTING; RANDOM SEARCH; TWO DIMENSIONAL INDUSTRIAL PACKING PROBLEM;

PACKAGING;

EID: 0032599517     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(99)00097-2     Document Type: Article

References (16)

1. András P., András, A., Zsuzsa, S. (1996). A genetic solution for the cutting stock problem. Proceedings of the First On-line Workshop on Soft Computing, Nagoya University, 87-92.
2. Coffman, E. G., Garey, M. R. and Johnson, D. S. (1984). Approximation algorithms for bin-packing - an updated survey. In: Algorithms Design for Computer Systems Design (Ausiello et al. (ed.), 49-106. Springer, Vienna.
3. Davis L. (1991). Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York.
4. Goldberg D. E. (1989). Genetic Algorithms in Search, Optimisation and Machine Learning. Addison-Wesley Publishing Company, Reading.
5. Dyckhoff H. (1990). Typology of cutting and packing problems. Europ. J. of OR, 88, 44, 2, 145-159.
6. Falkenauer E., Delchambre A. (1992). A genetic algorithm for bin-packing and line balancing. Proceedings of the 1992 EEEE International Conference on Robotics and Automation, 2, 1186-1192.
7. Hässler R. W., Sweeney, P. E. (1991). Cutting stock problems and solution procedures. European Journal of Operational Research, 54, 2, 141-150.
8. Hinxman A. I. (1980). The trim loss and assortment problems. Europ. J. of OR, 88, 5, 1, 8-18.
9. Hopper E. and Turton B. C. H. (1998). Application of genetic algorithms to packing problems - A review. In: Proceedings of the 2nd On-line World Conference on Soft Computing in Engineering Design and Manufacturing (P. K. Chawdhry, ed.), pp. 279-288. Springer Verlag, London.
10. Hwang S. M., Cheng Y. K. and Horng J. T. (1994). On solving rectangle bin packing problems using genetic algorithms. In: Proceedings of the 1994 IEEE Int. Conference on Systems, Man and Cybernetics, 1583-1590.
11. Jakobs S. (1996). On genetic algorithms for the packing of polygons. Europ. J. of OR, 88, 165-181.
12. Kröger B., Schwenderling P., Vornberger O. (1991). Parallel genetic packing of rectangles. In: Parallel Problem Solving from Nature 1st Workshop (J. Stender, ed.), pp. 160-164. Springer Verlag.
13. Kröger B. (1995). Guillontineable bin-packing: A genetic approach. Europ. J. of OR, 84, 645-661.
14. Sarin S. C. (1983). Two-dimensional stock cutting problems and solution methodologies. ASME Transactions, Journal of Engineering for Industry, 104, 3, 155-160.
15. Smith D. (1985). Bin-packing with adaptive search. In: Proceedings of an International Conference on Genetic Algorithms and their Applications (Grefenstette, ed.), pp. 202-206. Lawrence Erlbaum.
16. Syswerda D. (1991). Schedule optimisation using genetic algorithms. In: Handbook of Genetic Algorithms (Davis ed.), pp. 332-349. Van Nostrand Reinhold, New York.