A new evolutionary approach to cutting stock problems with and without contiguity

Computers and Operations Research

Volumn 29, Issue 12, 2002, Pages 1641-1659

  Liang, Ko Hsin ^a   Yao, Xin ^b   Newton, Charles ^a   Hoffman, David ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Combinatorial optimization; Cutting stock problems; Evolutionary algorithm

Indexed keywords

EVOLUTIONARY ALGORITHMS; GLOBAL OPTIMIZATION; HEURISTIC METHODS;

STOCK PROBLEMS;

INVENTORY CONTROL;

GENETIC ALGORITHM;

EID: 0036778942     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00039-9     Document Type: Article

References (29)

1. A typology of cutting and packing problems
2. One-dimensional cutting stock decision packing problems
3. Near-optimal solutions to one-dimensional cutting stock problems
4. The one dimensional cutting stock problem using two objectives
5. Genetic algorithms for cutting stock problems: With and without contiguity
6. Heuristics for sequencing cutting patterns
7. Approaches to cutting stock problem
8. The trim-loss and assortment problems: A survey
9. Cutting stock problems and solution procedures
10. A hybrid genetic algorithm for pallet loading
11. A multi-chromosome genetic algorithm for pallet loading
12. Evolutionary metaphors for the bin packing problem
13. Hybrid genetic algorithms for bin-packing and related problems
14. A hybrid grouping genetic algorithm for bin-packing
15. Applying evolutionary programming to selected control problems
16. Exploring self-adaptive methods to improve the efficiency of generating approximate solutions to traveling salesman problems using evolutionary programming
17. Applying evolutionary programming to selected control problems
18. A comparison of evolutionary programming and genetic algorithms on selected constrained optimization problems
19. Simulated annealing with extended neighbourhood
20. Comparison of different neighbourhood sizes in simulated annealing
21. A linear programming approach to the cutting stock problem
22. Continuous evolutionary programming: Analysis and experiments
23. A study of reproduction in generational and steady state genetic algorithms