EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3551. A heuristic for packing weighted unequal circles in circular containers
Invited abstract in session MB-7: Cutting and Packing 2 - 2D irregular, stream Cutting and Packing (ESICUP).
Monday, 10:30-12:00Room: 1019 (building: 202)
Authors (first author is the speaker)
| 1. | Yun Yang
|
| Management, The University of Birmingham | |
| 2. | Somayeh Allahyari
|
| Business School, The University of Birmingham | |
| 3. | Gu Pang
|
| Business School, The University of Birmingham | |
| 4. | Yong Lin
|
| University of Birmingham |
Abstract
The Weighted Circles Packing Problem (WCPP) is an extension of the classical circle packing problem with practical applications across various industries, including logistics, facility layout, automotive, manufacturing, telecommunications, and materials science. In WCPP, each circle is characterized not only by its size (i.e., radius) but also by a weight value, representing cost, value, priority, or other relevant metrics. This introduces complexity to the problem, as algorithms need to simultaneously consider the physical arrangement of circles and optimize their total weighted configuration. This study aims to maximize both the number of unequally sized circles packed in a container and the total layout score of the packed weighted circles while adhering to the constraint of non-overlapping circles or between each circle and the container. For this problem, we develop an Iterated Local Search metaheuristic algorithm where the initial feasible solution generated using polar coordinates and geometric methods is improved iteratively by local search and shaking procedures. Computational tests on a relaxed version of this problem using the benchmark published in López and Beasley (EJOR, 2016) clearly indicate the effectiveness and significant time-efficiency of the develop
Keywords
- Cutting and Packing
Status: accepted
Back to the list of papers