𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem

✍ Scribed by Burke, Edmund K.; Kendall, Graham; Whitwell, Glenn

Book ID
118251126
Publisher
Operations Research Society of America
Year
2009
Tongue
English
Weight
677 KB
Volume
21
Category
Article
ISSN
0899-1499

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[ACM Press the 8th annual conference - S
[ACM Press the 8th annual conference - Seattle, Washington, USA (2006.07.08-2006.07.12)] Proceedings of the 8th annual conference on Genetic and evolutionary computation - GECCO '06 - A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem
✍ Terashima-MarΓ­n, H.; FarΓ­as ZΓ‘rate, C. J.; Ross, P.; Valenzuela-RendΓ³n, M. πŸ“‚ Article πŸ“… 2006 πŸ› ACM Press 🌐 English βš– 169 KB
[ACM Press the 8th annual conference - S
[ACM Press the 8th annual conference - Seattle, Washington, USA (2006.07.08-2006.07.12)] Proceedings of the 8th annual conference on Genetic and evolutionary computation - GECCO '06 - A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem
✍ Terashima-MarΓ­n, H.; FarΓ­as ZΓ‘rate, C. J.; Ross, P.; Valenzuela-RendΓ³n, M. πŸ“‚ Article πŸ“… 2006 πŸ› ACM Press 🌐 English βš– 169 KB

The idea behind hyper-heuristics is to discover some combination of straightforward heuristics to solve a wide range of problems. To be worthwhile, such combination should outperform the single heuristics. This paper presents a GAbased method that produces general hyper-heuristics that solve two-dim