A hybrid beam search looking-ahead algorithm for the circular packing problem
From MaRDI portal
Publication:711396
DOI10.1007/S10878-008-9191-8zbMATH Open1200.90141OpenAlexW2060461240MaRDI QIDQ711396FDOQ711396
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
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- An improved typology of cutting and packing problems
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Title not available (Why is that?)
- A new heuristic algorithm for rectangle packing
- Approximate algorithms for constrained circular cutting problems
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Packing different-sized circles into a rectangular container
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- PERM for solving circle packing problem
- Algorithms for the circular two-dimensional open dimension problem
- A simulated annealing approach for the circular cutting problem
- Annealing, Cylinder Packing By Simulated
- Algorithms for the constrained two-staged two-dimensional cutting problem
- Multi-Start Methods
- The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- A cooperative algorithm for constrained two-staged two-dimensional cutting problems
- Adaptive algorithms for circular cutting/packing problems
- Order Allocation for Stock Cutting in the Paper Industry
Cited In (12)
- Adaptive beam search lookahead algorithms for the circular packing problem
- A beam search implementation for the irregular shape packing problem
- Adaptive algorithms for circular cutting/packing problems
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Adaptive large neighborhood search for solving the circle bin packing problem
- A memetic algorithm to pack unequal circles into a square
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- A beam search algorithm for the circular packing problem
- Algorithms for the circular two-dimensional open dimension problem
- Beam search and non-linear programming tools for the circular packing problem
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
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)
