Random search in the one-dimensional cutting stock problem

DOI10.1016/0377-2217(95)00198-0MaRDI QIDQ1278375zbMATH OpenOpenAlexFDO

Authors Richard Vahrenkamp

Publication date 22 February 1999

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

Full work available at URL https://doi.org/10.1016/0377-2217(95)00198-0

zbMATH Keywords

bin packingmultiple solutionsone-dimensional cutting stockrandom approach

Mathematics Subject Classification ID

Search theory (90B40)

Recommendations

• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• Near-optimal solutions to one-dimensional cutting stock problems
• One-dimensional cutting stock problems and solution procedures
• A sequential heuristic procedure for one-dimensional cutting
• scientific article; zbMATH DE number 1050896

Cites work

• A one-dimensional cutting stock problem in the aluminium industry and its solution
• Composite stock cutting through simulated annealing
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• Cutting stock problems and solution procedures
• Heuristic algorithms for the multiple knapsack problem
• scientific article; zbMATH DE number 864851 (Why is no real title available?)
• Some experiments with simulated annealing techniques for packing problems
• The cutting stock problem and integer rounding

Cited in

(14)

• An effective solution for a real cutting stock problem in manufacturing plastic rolls
• A genetic algorithm solution for one-dimensional bundled stock cutting
• One-dimensional cutting stock problem to minimize the number of different patterns
• Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
• One side cut accelerated random search
• Solving a combined cutting-stock and lot-sizing problem with a column generating procedure
• Alternative configurations for cutting machines in a tube cutting mill
• scientific article; zbMATH DE number 1803213 (Why is no real title available?)
• Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• scientific article; zbMATH DE number 3891135 (Why is no real title available?)
• Progressive selection method for the coupled lot-sizing and cutting-stock problem
• One-side oscillation strategic approach

This page was built for publication: Random search in the one-dimensional cutting stock problem

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