A simulated annealing approach for the circular cutting problem
From MaRDI portal
Publication:1876197
DOI10.1016/S0377-2217(03)00417-XzbMath1065.90082OpenAlexW2162530405MaRDI QIDQ1876197
Mhand Hifi, Vangelis Th. Paschos, Vassilios Zissimopoulos
Publication date: 16 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00417-x
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (21)
Dense packing of congruent circles in free-form non-convex containers ⋮ A simulated annealing approach for the circular cutting problem ⋮ Adaptive simulated annealing with greedy search for the circle bin packing problem ⋮ A dynamic adaptive local search algorithm for the circular packing problem ⋮ An action-space-based global optimization algorithm for packing circles into a square container ⋮ An anchorage planning strategy with safety and utilization considerations ⋮ Packing non-identical circles within a rectangle with open length ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Parallel greedy algorithms for packing unequal circles into a strip or a rectangle ⋮ Packing circles into perimeter-minimizing convex hulls ⋮ Valid constraints for the Point Packing in a Square problem ⋮ Packing unequal circles into a strip of minimal length with a jump algorithm ⋮ Solving circle packing problems by global optimization: numerical results and industrial applications ⋮ Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes ⋮ A beam search algorithm for the circular packing problem ⋮ Adaptive and restarting techniques-based algorithms for circular packing problems ⋮ The antennas preassignment problem ⋮ A hybrid beam search looking-ahead algorithm for the circular packing problem ⋮ Recursive circle packing problems ⋮ A model to design recreational boat mooring fields ⋮ GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID
Cites Work
- Unnamed Item
- Optimising the palletisation of cylinders in cases
- Solution approaches to irregular nesting problems
- Packing different-sized circles into a rectangular container
- Integrated container loading software for pulp and paper industry
- A typology of cutting and packing problems
- A simulated annealing approach for the circular cutting problem
- Repeated patterns of dense packings of equal disks in a square
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Simulated Annealing – An Annotated Bibliography
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Cylinder packing by simulated annealing
- Equation of State Calculations by Fast Computing Machines
- The Theory and Computation of Knapsack Functions
- A Multistage Solution of the Template-Layout Problem
This page was built for publication: A simulated annealing approach for the circular cutting problem
