Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem

Computers and Industrial Engineering

Volumn 40, Issue 3, 2001, Pages 201-214

  Leung, T W ^a   Yung, C H ^b   Troutt, Marvin D ^c  

^a HONG KONG INSTITUTE OF VOCATIONAL EDUCATION   (Hong Kong)

^b LINGNAN UNIVERSITY   (Hong Kong)

^c KENT STATE UNIVERSITY   (United States)

Author keywords

Bottom left algorithm; Difference process; Genetic algorithm; Simulated annealing

Indexed keywords

DECISION SUPPORT SYSTEMS; GENETIC ALGORITHMS; HEURISTIC METHODS; INVENTORY CONTROL; PROBLEM SOLVING; PROCESS ENGINEERING; PRODUCTION CONTROL; SCHEDULING; SIMULATED ANNEALING; STRATEGIC PLANNING;

BOTTOM LEFT ALGORITHMS; NON-GUILLOTINE CUTTING STOCKS;

COMPUTER INTEGRATED MANUFACTURING;

EID: 0035400052     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(01)00021-3     Document Type: Article

References (24)

1. An exact two-dimensional non-guillotine cutting tree search procedure
2. An exact algorithm for general, orthogonal two-dimensional knapsack problems
3. Genetic algorithms and tabu search: Hybrids for optimization
4. On genetic algorithms for the packing of polygons
5. Optimization by simulated annealing
6. New directions in genetic algorithm theory
7. Developing a simulated annealing algorithm for the cutting stock problem
8. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
9. Convergence of an annealing algorithm
10. Equations of state calculation by fast computing machines
11. Solution for the constrained guillotine cutting problem by simulated annealing
12. Three dimensional palletization of mixed box sizes
13. No free lunch theorems for optimization