A genetic algorithm solution for one-dimensional bundled stock cutting

DOI10.1016/S0377-2217(98)00244-6zbMath0998.90524MaRDI QIDQ1847176

Bret J. Wagner

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

linear programmingheuristicsinteger programminggenetic algorithmscutting

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (5)

An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production ⋮ Trim loss optimization by an improved differential evolution ⋮ The stochastic trim-loss problem ⋮ The one-dimensional cutting stock problem with due dates

Cites Work

• Unnamed Item
• Unnamed Item
• Composite stock cutting through simulated annealing
• Random search in the one-dimensional cutting stock problem
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• A typology of cutting and packing problems
• Optimal solutions for the cutting stock problem
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• A Linear Programming Approach to the Cutting-Stock Problem
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems

This page was built for publication: A genetic algorithm solution for one-dimensional bundled stock cutting