A hybrid beam search looking-ahead algorithm for the circular packing problem

DOI10.1007/s10878-008-9191-8zbMath1200.90141OpenAlexW2060461240MaRDI QIDQ711396

Hakim Akeb, Mhand Hifi

Publication date: 26 October 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9191-8

zbMATH Keywords

knapsack problemsminimum local-distance position

Mathematics Subject Classification ID

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

Related Items (4)

Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container ⋮ 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 ⋮ Adaptive large neighborhood search for solving the circle bin packing problem

Cites Work

• Unnamed Item
• A cooperative algorithm for constrained two-staged two-dimensional cutting problems
• A new heuristic algorithm for rectangle packing
• Adaptive algorithms for circular cutting/packing problems
• Packing different-sized circles into a rectangular container
• Approximate algorithms for constrained circular cutting problems
• A simulated annealing approach for the circular cutting problem
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle
• PERM for solving circle packing problem
• The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
• An improved typology of cutting and packing problems
• Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem
• Approximation Algorithms for Problems Combining Facility Location and Network Design
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• Order Allocation for Stock Cutting in the Paper Industry
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
• Multi-Start Methods
• Algorithms for the circular two‐dimensional open dimension problem
• Cylinder packing by simulated annealing

This page was built for publication: A hybrid beam search looking-ahead algorithm for the circular packing problem