Packing unequal rectangles and squares in a fixed size circular container using formulation space search
From MaRDI portal
(Redirected from Publication:1652609)
Abstract: In this paper we formulate the problem of packing unequal rectangles/squares into a fixed size circular container as a mixed-integer nonlinear program. Here we pack rectangles so as to maximise some objective (e.g. maximise the number of rectangles packed or maximise the total area of the rectangles packed). We show how we can eliminate a nonlinear maximisation term that arises in one of the constraints in our formulation. We indicate the amendments that can be made to the formulation for the special case where we are maximising the number of squares packed. A formulation space search heuristic is presented and computational results given for publicly available test problems involving up to 30 rectangles/squares. Our heuristic deals with the case where the rectangles are of fixed orientation (so cannot be rotated) and with the case where the rectangles can be rotated through ninety degrees.
Recommendations
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- Packing unequal circles using formulation space search
- Packing circular-like objects in a rectangular container
- A heuristic for the circle packing problem with a variety of containers
- Integer programming formulations for approximate packing circles in a rectangular container
Cites work
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- A heuristic approach for packing identical rectangles in convex regions
- A heuristic for the circle packing problem with a variety of containers
- A new heuristic algorithm for rectangle packing
- A new local search for continuous location problems
- A note on solving MINLP's using formulation space search
- A novel non-linear approach to minimal area rectangular packing
- A reduction approach for solving the rectangle packing area minimization problem
- An effective quasi-human based heuristic for solving the rectangle packing problem
- An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- An improved typology of cutting and packing problems
- Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Formulation space search approach for the teacher/class timetabling problem
- Formulation Space Search for Circle Packing Problems
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Method of sentinels for packing items within arbitrary convex regions
- Models and algorithms for packing rectangles into the smallest square
- Optimal rectangle packing
- Optimal rectangle packing: an absolute placement approach
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Packing into the smallest square: worst-case analysis of lower bounds
- Packing problems
- Packing unequal circles using formulation space search
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- Reformulation descent applied to circle packing problems
- SCIP: solving constraint integer programs
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Symmetry-breaking constraints for packing identical rectangles within polyhedra
- Two-dimensional packing problems: a survey
- Variable neighborhood search: basics and variants
- Variable space search for graph coloring
- Worst-case analysis of fast heuristics for packing squares into a square
Cited in
(12)- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- Packing circular-like objects in a rectangular container
- Packing unequal circles using formulation space search
- A heuristic for the circle packing problem with a variety of containers
- A skyline-based heuristic for orthogonal packing rectangles in a circle
- A goal-driven iterated local search approach based on the maximal-space for the circle bin-packing problem with rectangular items
- An effective evolutionary algorithm for packing rectangles into a fixed size circular container
- Hybrid-biased genetic algorithm for packing unequal rectangles into a fixed-size circle
This page was built for publication: Packing unequal rectangles and squares in a fixed size circular container using formulation space search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652609)
