Random search in the one-dimensional cutting stock problem

DOI10.1016/0377-2217(95)00198-0zbMath0953.90529OpenAlexW1981819779MaRDI QIDQ1278375

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

multiple solutionsbin packingone-dimensional cutting stockrandom approach

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (10)

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 ⋮ Alternative configurations for cutting machines in a tube cutting mill ⋮ Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost ⋮ Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem ⋮ An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem ⋮ Solving a combined cutting-stock and lot-sizing problem with a column generating procedure ⋮ 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

Cites Work

• Unnamed Item
• Heuristic algorithms for the multiple knapsack problem
• Cutting stock problems and solution procedures
• Composite stock cutting through simulated annealing
• Some experiments with simulated annealing techniques for packing problems
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• The cutting stock problem and integer rounding
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems

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