Paper Info
Title
Using Valid Inequalities And Different Grids In Lp-Based Heuristic For Packing Circular Objects
Abstract
Using a regular grid to approximate a container, packing is reduced to assigning objects to the nodes of the grid subject to non-overlapping constraints. The packing problem is then stated as a large scale linear 0-1 optimization problem. A problem of packing unequal circles in a fixed size rectangular container is considered. The circle is considered as a set of points that are all the same distance (not necessary Euclidean) from a given point. Different shapes, such as ellipses, rhombuses, rectangles, octagons, etc. can be treated similarly by simply changing the definition of the norm used to define the distance. Valid inequalities are used to strengthening the LP-relaxation. An LP-based heuristic is proposed. Numerical results on packing circles and octagons are presented to demonstrate the efficiency of the proposed approach.
Year
DOI
Venue
2016
10.1007/978-3-662-49390-8_66
INTELLIGENT INFORMATION AND DATABASE SYSTEMS, ACIIDS 2016, PT II
Keywords
Field
DocType
Packing, Integer programming, Large scale optimization, Heuristic
Data mining,Discrete mathematics,Heuristic,Mathematical optimization,Packing problems,Regular grid,Computer science,Square packing in a square,Euclidean geometry,Circle packing,Optimization problem,Grid
Conference
Volume
ISSN
Citations 
9622
0302-9743
0
PageRank 
References 
Authors
0.34
10
3
Name
Order
Citations
PageRank
Igor S. Litvinchev13310.71
Luis Infante200.68
Edith Lucero Ozuna Espinosa300.68