An application of simulated annealing to the cutting stock problem

DOI10.1016/S0377-2217(98)00207-0zbMath0938.90057MaRDI QIDQ1124712

Loris Faina

Publication date: 25 November 1999

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

zbMATH Keywords

simulated annealingcutting problemsglobal optimization algorithmtwo-dimensional cutting stock problemguillotine and non-guillotine constraints

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (max. 100)

Simplest optimal cutting patterns for equal rectangles ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ A hybrid placement strategy for the three-dimensional strip packing problem ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ A survey on the cutting and packing problems ⋮ Heuristic algorithm for a cutting stock problem in the steel bridge construction ⋮ Dynamic programming algorithms for the optimal cutting of equal rectangles ⋮ Local search of orthogonal packings using the lower bounds ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ A global optimization algorithm for the three-dimensional packing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Probabilistic exchange algorithms and Euclidean traveling salesman problems
• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
• Analysis and design of algorithms in combinatorial optimization. (School held in Udine in September 1979)
• An evaluation of the Sniffer global optimization algorithm using standard test functions
• Seeking global minima
• A typology of cutting and packing problems
• Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
• The dissection of rectangles into squares
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Convergence of an annealing algorithm
• Algorithms for Packing Squares: A Probabilistic Analysis
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: An application of simulated annealing to the cutting stock problem