Packing different-sized circles into a rectangular container

DOI10.1016/0377-2217(95)00032-LzbMath0928.90077OpenAlexW2049419174MaRDI QIDQ1127229

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

zbMATH Keywords

circle packing genetic algorithm nonlinear mixed integer programming rectangular container quasi-random technique

Mathematics Subject Classification ID

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

Related Items

A simulated annealing approach for the circular cutting problem, 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, A local search-based method for sphere packing problems, A formulation space search heuristic for packing unequal circles in a fixed size circular container, Polynomial-time approximation schemes for circle and other packing problems, An effective hybrid algorithm for the problem of packing circles into a larger containing circle, Effective methods for a container packing operation, An improved typology of cutting and packing problems, A dynamic adaptive local search algorithm for the circular packing problem, An action-space-based global optimization algorithm for packing circles into a square container, A memetic algorithm to pack unequal circles into a square, High density packings of equal circles in rectangles with variable aspect ratio, Packing non-identical circles within a rectangle with open length, A family of genetic algorithms for the pallet loading problem, Metaheuristics: A bibliography, A literature review on circle and sphere packing problems: models and methodologies, Parallel greedy algorithms for packing unequal circles into a strip or a rectangle, Valid constraints for the Point Packing in a Square problem, Packing unequal circles into a strip of minimal length with a jump algorithm, Simplest optimal guillotine cutting patterns for strips of identical circles, Approximate algorithms for constrained circular cutting problems, Solving circle packing problems by global optimization: numerical results and industrial applications, PERM for solving circle packing problem, Packing circular-like objects in a rectangular container, Efficient approaches for furnace loading of cylindrical parts, A beam search algorithm for the circular packing problem, Adaptive and restarting techniques-based algorithms for circular packing problems, New heuristics for packing unequal circles into a circular container, A hybrid beam search looking-ahead algorithm for the circular packing problem, Cylinder packing by simulated annealing, A bi-objective guillotine cutting problem of stamping strips of equal circles, A dual-response forwarding approach for containerizing air cargoes under uncertainty, based on stochastic mixed 0-1 programming, Recursive circle packing problems, A model to design recreational boat mooring fields, An algorithm to construct conformable tubular networks that occupy arbitrary regions in \(\mathbb{R}^3\), Column enumeration based decomposition techniques for a class of non-convex MINLP problems, Cutting circles and polygons from area-minimizing rectangles, Applying genetic algorithms and neural networks to the container loading problem, GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID, Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors, An improved algorithm for the packing of unequal circles within a larger containing circle, A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure

Cites Work