Greedy algorithms for packing unequal circles into a rectangular container

DOI10.1057/palgrave.jors.2601836zbMath1095.90095OpenAlexW2031952360MaRDI QIDQ5464427

Hakim Akeb, Wenqi Huang, Chu-Min Li, Yu Li

Publication date: 17 August 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601836

zbMATH Keywords

combinatorial optimizationgreedy algorithmheuristiccircle packing problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

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 ⋮ Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container ⋮ A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ Packing unequal spheres into various containers ⋮ Differential evolution methods based on local searches ⋮ An action-space-based global optimization algorithm for packing circles into a square 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 ⋮ 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 ⋮ A reference length approach for the 3D strip packing problem ⋮ Parallel greedy algorithms for packing unequal circles into a strip or a rectangle ⋮ 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 ⋮ Adaptive beam search lookahead algorithms for the circular packing problem ⋮ Packing identical spheres into a cylinder ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ A beam search algorithm for the circular packing problem ⋮ Adaptive and restarting techniques-based algorithms for circular packing problems ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Recursive circle packing problems ⋮ A model to design recreational boat mooring fields ⋮ Packing cylinders and rectangular parallelepipeds with distances between them into a given region ⋮ Optimized filling of a given cuboid with spherical powders for additive manufacturing ⋮ Column enumeration based decomposition techniques for a class of non-convex MINLP problems ⋮ Cutting circles and polygons from area-minimizing rectangles ⋮ GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID