Approximate Packing Circles in a Rectangular Container: Valid Inequalities and Nesting
A problem of packing a limited number of unequal circles in a fixed size rectangular container is considered. The aim is to maximize the (weighted) number of circles placed into the container or minimize the waste. This problem has numerous applications in logistics, including production and packing for the textile, apparel, naval, automobile, aerospace and food industries. Frequently the problem is formulated as a nonconvex continuous optimization problem which is solved by heuristic techniques combined with the local search procedures. A new formulation is proposed based on using a regular grid approximated the container and considering the nodes of the grid as potential positions for assigning centers of the circles. The packing problem is then stated as a large scale linear 0-1 optimization problem. The binary variables represent the assignment of centers to the nodes of the grid. The resulting binary problem is then solved by the commercial software. Two families of valid inequalities are proposed to strengthening the formulation. Nesting circles inside one another is also considered. Numerical results are presented to demonstrate the efficiency of the proposed approach.
| Main Authors: | , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Universidad Nacional Autónoma de México, Instituto de Ciencias Aplicadas y Tecnología
2014
|
| Online Access: | http://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S1665-64232014000400009 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|