Composite stock cutting through simulated annealing
From MaRDI portal
Publication:1197089
DOI10.1016/0895-7177(92)90078-YzbMath0757.90070OpenAlexW2062618536MaRDI QIDQ1197089
Bruce McMillin, Pipatpong Poshyanonda, Hanan L. Lutfiyya, Cihan H. Dagli
Publication date: 16 January 1993
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(92)90078-y
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Fast neighborhood search for two- and three-dimensional nesting problems ⋮ Metaheuristics: A bibliography ⋮ Solution approaches to irregular nesting problems ⋮ An object-based evolutionary algorithm for solving nesting problems ⋮ Random search in the one-dimensional cutting stock problem ⋮ Image reconstruction using simulated annealing in electrical impedance tomography: a new approach ⋮ A genetic algorithm solution for one-dimensional bundled stock cutting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- The trim-loss and assortment problems: A survey
- Knowledge-based systems for cutting stock problems
- A Linear Programming Approach to the Cutting-Stock Problem
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
- Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
- A New Linear Programming Approach to the Cutting Stock Problem
- An Algorithm for Two-Dimensional Cutting Problems
- Beitrag zur Theorie des Ferromagnetismus
- Equation of State Calculations by Fast Computing Machines
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey