Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

T. W. Leung, Chi Kin Chan, Marvin D. Troutt

Research output: Journal article publicationJournal articleAcademic researchpeer-review

78 Citations (Scopus)


In this paper a pure meta-heuristic (genetic algorithm) and a mixed meta-heuristic (simulated annealing-genetic algorithm) were applied to two-dimensional orthogonal packing problems and the results were compared. The major motivation for applying a modified genetic algorithm is as an attempt to alleviate the problem of pre-mature convergence. We found that in the long run, the mixed heuristic produces better results; while the pure heuristic produces only "good" results, but produces them faster.
Original languageEnglish
Pages (from-to)530-542
Number of pages13
JournalEuropean Journal of Operational Research
Issue number3
Publication statusPublished - 16 Mar 2003


  • Difference process strategy
  • Genetic algorithm
  • Meta-heuristics
  • Mixed heuristics
  • Simulated annealing
  • Two-dimensional orthogonal packing problem

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this