Approximate algorithms for constrained circular cutting problems
From MaRDI portal
Publication:1433164
DOI10.1016/S0305-0548(03)00020-0zbMath1061.90095MaRDI QIDQ1433164
Publication date: 15 June 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (28)
A local search-based method for sphere packing problems ⋮ A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem ⋮ Adaptive simulated annealing with greedy search for the circle bin packing problem ⋮ Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container ⋮ An improved typology of cutting and packing problems ⋮ A dynamic adaptive local search algorithm for the circular packing problem ⋮ An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container ⋮ A memetic algorithm to pack unequal circles into a square ⋮ An anchorage planning strategy with safety and utilization considerations ⋮ High density packings of equal circles in rectangles with variable aspect ratio ⋮ Packing non-identical circles within a rectangle with open length ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary ⋮ Parallel greedy algorithms for packing unequal circles into a strip or a rectangle ⋮ 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 ⋮ PERM for solving circle packing problem ⋮ Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors ⋮ A beam search algorithm for the circular packing problem ⋮ Adaptive and restarting techniques-based algorithms for circular packing problems ⋮ New heuristics for packing unequal circles into a circular container ⋮ A hybrid beam search looking-ahead algorithm for the circular packing problem ⋮ A bi-objective guillotine cutting problem of stamping strips of equal circles ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Convex maximization formulation of general sphere packing problem ⋮ GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID ⋮ A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing different-sized circles into a rectangular container
- An and-or-graph approach for two-dimensional cutting problems
- Packing problems
- A genetic algorithm for the set covering problem
- Integrated container loading software for pulp and paper industry
- Repeated patterns of dense packings of equal disks in a square
- An Algorithm for Two-Dimensional Cutting Problems
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Multistage Cutting Stock Problems of Two and More Dimensions
This page was built for publication: Approximate algorithms for constrained circular cutting problems
