Solution for the constrained Guillotine cutting problem by simulated annealing

DOI10.1016/S0305-0548(97)00036-1zbMath0906.90148OpenAlexW2046660960MaRDI QIDQ1265860

Víctor Parada, Mauricio Sepúlveda, Arlindo Gómes, Mauricio Solar

Publication date: 27 September 1998

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00036-1

zbMATH Keywords

constrained two-dimensional cutting problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (6)

A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem ⋮ A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern ⋮ A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces ⋮ Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

Cites Work

• Optimization by Simulated Annealing
• Simulated annealing: A tool for operational research
• Exact solutions for constrained two-dimensional cutting problems
• The trim-loss and assortment problems: A survey
• An and-or-graph approach for two-dimensional cutting problems
• An improved version of Wang's algorithm for two-dimensional cutting problems
• A typology of cutting and packing problems
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• An Algorithm for Two-Dimensional Cutting Problems
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• The Theory and Computation of Knapsack Functions

This page was built for publication: Solution for the constrained Guillotine cutting problem by simulated annealing