A hybrid heuristic to reduce the number of different patterns in cutting stock problems

A note on “Reducing the number of binary

A note on “Reducing the number of binary variables in cutting stock problems”

✍ Hao-Chun Lu, Yu-Chien Ko, Yao-Huei Huang 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 323 KB

Reducing the number of unknowns in a con

Reducing the number of unknowns in a constrained minimisation problem—an appliation to material balances

✍ D.E. Simpson; M.G. Everett; V.R. Voller 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 609 KB

A hybrid approach based on genetic algor

A hybrid approach based on genetic algorithms to solve the problem of cutting structural beams in a metalwork company

✍ Gracia, Carlos; AndrÃ©s, Carlos; Gracia, Luis 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 849 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

[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