Packing different-sized circles into a rectangular container

DOI10.1016/0377-2217(95)00032-LzbMATH Open0928.90077OpenAlexW2049419174MaRDI QIDQ1127229FDOQ1127229

Authors: John A. George, Jennifer M. George, Bruce W. Lamar 

Publication date: 13 August 1998

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00032-l

Recommendations

• A heuristic for the circle packing problem with a variety of containers
• Integer programming formulations for approximate packing circles in a rectangular container
• Proportional packing of circles in a circular container
• Packing circular-like objects in a rectangular container
• Recursive circle packing problems

zbMATH Keywords

genetic algorithmcircle packingnonlinear mixed integer programmingrectangular containerquasi-random technique

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Cutting stock problems and solution procedures
• Packing problems
• Complexity results for scheduling chains on a single machine
• Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
• Integrated container loading software for pulp and paper industry
• Optimising the palletisation of cylinders in cases
• A family of genetic algorithms for the pallet loading problem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (48)

• Adaptive and restarting techniques-based algorithms for circular packing problems
• New heuristics for packing unequal circles into a circular container
• A dynamic adaptive local search algorithm for the circular packing problem
• Integer programming formulations for approximate packing circles in a rectangular container
• Efficient approaches for furnace loading of cylindrical parts
• Valid constraints for the Point Packing in a Square problem
• Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
• Proportional packing of circles in a circular container
• A bi-objective guillotine cutting problem of stamping strips of equal circles
• A model to design recreational boat mooring fields
• Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
• A probability collectives approach for multi-agent distributed and cooperative optimization with tolerance for agent failure
• Cutting circles and polygons from area-minimizing rectangles
• Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
• A memetic algorithm to pack unequal circles into a square
• Column enumeration based decomposition techniques for a class of non-convex MINLP problems
• Recursive circle packing problems
• A formulation space search heuristic for packing unequal circles in a fixed size circular container
• A literature review on circle and sphere packing problems: models and methodologies
• Polynomial-time approximation schemes for circle and other packing problems
• An action-space-based global optimization algorithm for packing circles into a square container
• An improved typology of cutting and packing problems
• Packing unequal spheres into various containers
• High density packings of equal circles in rectangles with variable aspect ratio
• A heuristic for the circle packing problem with a variety of containers
• Solving circle packing problems by global optimization: numerical results and industrial applications
• A dual-response forwarding approach for containerizing air cargoes under uncertainty, based on stochastic mixed 0-1 programming
• A hybrid beam search looking-ahead algorithm for the circular packing problem
• A local search-based method for sphere packing problems
• A beam search algorithm for the circular packing problem
• Approximate algorithms for constrained circular cutting problems
• Applying genetic algorithms and neural networks to the container loading problem
• An improved algorithm for the packing of unequal circles within a larger containing circle
• A mathematical model and a solution method for the problem of placing various-sized circles into a strip
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• Packing circular-like objects in a rectangular container
• Simplest optimal guillotine cutting patterns for strips of identical circles
• Effective methods for a container packing operation
• An algorithm to construct conformable tubular networks that occupy arbitrary regions in \(\mathbb{R}^3\)
• Metaheuristics: A bibliography
• Annealing, Cylinder Packing By Simulated
• Greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
• A simulated annealing approach for the circular cutting problem
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle
• Packing non-identical circles within a rectangle with open length
• A family of genetic algorithms for the pallet loading problem
• Packing unequal circles into a strip of minimal length with a jump algorithm
• PERM for solving circle packing problem

This page was built for publication: Packing different-sized circles into a rectangular container

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