Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic

European Journal of Operational Research

Volumn 183, Issue 3, 2007, Pages 1230-1248

  Binkley, Kevin J ^a   Hagiwara, Masafumi ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

Cutting; Evolutionary algorithms; Genetic algorithms; Packing; Simulated annealing

Indexed keywords

ADAPTIVE ALGORITHMS; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; SIMULATED ANNEALING;

SELF-ADAPTIVE EVOLUTIONARY ALGORITHMS; TWO-DIMENSIONAL PACKING PROBLEMS; ZERO TRIM LOSS;

OPERATIONS RESEARCH;

EID: 34447092995     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.12.029     Document Type: Article

References (16)

1. Babu A.R., and Babu N.R. Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. International Journal of Production Research 37 7 (1999) 1625-1643
2. Bäck T. Optimal mutation rates in genetic search. In: Forrest S. (Ed). Proceedings of the 5th International Conference on Genetic Algorithms, Urbana-Champaign, IL, USA, June 1993 (1993), Morgan Kaufmann 2-8
3. Bäck T. Mutation parameters. In: Bäck T., Fogel D.B., and Michalewicz Z. (Eds). Evolutionary Computation 2: Advanced Algorithms and Operators (2000), Institute of Physics Publishing, United Kingdom 142-151
4. Goldberg D.E. Genetic Algorithms in Search Optimization and Machine Learning (1989), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA
5. Goldberg, D.E., Deb, K., Clark, J.H., 1991. Genetic algorithms, noise, and the sizing of populations. Technical Report 91010, University of Illinois at Urbana-Champaign.
6. Hopper E., and Turton B.C.H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2d packing problem. European Journal of Operational Research 128 1 (2001) 34-57
7. Jakobs S. On genetic algorithms for the packing of polygons. European Journal of Operational Research 88 (1996) 165-181
8. Lai K.K., and Chan J.W.M. Developing a simulated annealing algorithm for the cutting stock problem. Computers and Industrial Engineering 32 1 (1997) 115-127
9. Lesh N., Marks J., McMahon A., and Mitzenmacher M. Exhaustive approaches to 2d rectangular perfect packings. Information Processing Letters 90 1 (2004) 7-14
10. Leung T.W., Chan C.K., and Troutt M.D. Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. European Journal of Operational Research 145 3 (2003) 530-542
11. Lodi A., Martello S., and Monaci M. Two-dimensional packing problems: A survey. European Journal of Operational Research 141 2 (2002) 241-252
12. Mahfoud S.W., and Goldberg D.E. Parallel recombinative simulated annealing - a genetic algorithm. Parallel Computing 21 1 (1995) 1-28
13. Spears W.M. Adapting crossover in evolutionary algorithms. In: McDonnell J.R., Reynolds R.G., and Fogel D.B. (Eds). Proceedings of the Fourth Annual Conference on Evolutionary Programming (1995), MIT Press, Cambridge, MA 367-384
14. Wäscher, G., Haussner, H., Schumann, H., 2006. An improved typology of cutting and packing problems, European Journal of Operational Research, this issue, doi:10.1016/j.ejor.2005.12.047.
15. Whitely D. Permutations. In: Bäck T., Fogel D.B., and Michalewicz Z. (Eds). Handbook of Evolutionary Computation (1997), IOP Publishing Ltd., Bristol, UK C3.3:14-C3.3:20
16. Yao X., Liu Y., and Lin G.M. Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation 3 2 (1999) 82-102