A genetic algorithm solution for one-dimensional bundled stock cutting

DOI10.1016/S0377-2217(98)00244-6MaRDI QIDQ1847176zbMATH OpenFDO

Authors Bret J. Wagner

Publication date 17 November 2002

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

Full work available at URL https://doi.org/10.1016/S0377-2217(98)00244-6

zbMATH Keywords

cuttinggenetic algorithmsheuristicsinteger programminglinear programming

Mathematics Subject Classification ID

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

Recommendations

• One-dimensional cutting stock problems and solution procedures
• An integrated genetic algorithm approach to 1D-cutting stock problem
• Near-optimal solutions to one-dimensional cutting stock problems
• Random search in the one-dimensional cutting stock problem
• scientific article; zbMATH DE number 2043380

Cites work

• A Linear Programming Approach to the Cutting-Stock Problem
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• A typology of cutting and packing problems
• Composite stock cutting through simulated annealing
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• scientific article; zbMATH DE number 635660 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Optimal solutions for the cutting stock problem
• Random search in the one-dimensional cutting stock problem

Cited in

(10)

• The stochastic trim-loss problem
• The one-dimensional cutting stock problem with due dates
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
• A hybrid approach for optimization of one-dimensional cutting
• An integrated genetic algorithm approach to 1D-cutting stock problem
• An evolutionary algorithm of one dimensional stock cutting problem based on variable length coding
• An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
• scientific article; zbMATH DE number 2043380 (Why is no real title available?)
• Trim loss optimization by an improved differential evolution

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847176)