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

DOI10.1007/S10878-008-9191-8MaRDI QIDQ711396zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Adaptive beam search lookahead algorithms for the circular packing problem
• A beam search algorithm for the circular packing problem
• Beam search and non-linear programming tools for the circular packing problem
• Adaptive algorithms for circular cutting/packing problems
• Solving the circular open dimension problem by using separate beams and look-ahead strategies

Cites work

• scientific article; zbMATH DE number 1175962 (Why is no real title available?)
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• A cooperative algorithm for constrained two-staged two-dimensional cutting problems
• A new heuristic algorithm for rectangle packing
• A simulated annealing approach for the circular cutting problem
• Adaptive algorithms for circular cutting/packing problems
• Algorithms for the circular two-dimensional open dimension problem
• Algorithms for the constrained two-staged two-dimensional cutting problem
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle
• An improved typology of cutting and packing problems
• Annealing, Cylinder Packing By Simulated
• Approximate algorithms for constrained circular cutting problems
• Approximation Algorithms for Problems Combining Facility Location and Network Design
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
• Multi-Start Methods
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• Order Allocation for Stock Cutting in the Paper Industry
• PERM for solving circle packing problem
• Packing different-sized circles into a rectangular container
• The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach

Cited in

(12)

• Solving the circular open dimension problem by using separate beams and look-ahead strategies
• Beam search and non-linear programming tools for the circular packing problem
• Algorithms for the circular two-dimensional open dimension problem
• Adaptive large neighborhood search for solving the circle bin packing problem
• A beam search algorithm for the circular packing problem
• Adaptive beam search lookahead algorithms for the circular packing problem
• A memetic algorithm to pack unequal circles into a square
• A beam search approach to solve the convex irregular bin packing problem with guillotine guts
• A beam search implementation for the irregular shape packing problem
• 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
• Adaptive algorithms for circular cutting/packing problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711396)