.png){kind=icon}
.png){kind=icon}
Return
Recursive circle packing problems
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.12107.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a class of packing problems where circles may be placed either inside or outside other circles, the whole set being packed in a rectangle. This corresponds to a practical problem of packing tubes in a container. Before being inserted in the container, tubes may be put inside other tubes in a recursive fashion. A variant of the greedy randomized adaptive search procedure is proposed for tackling this problem, and its performance is assessed in a set of benchmark instances.
Keywords:
packing problems
knapsack problems
heuristics
practice of OR
combinatorial optimization
integer programming
loading problems
local search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
1.8K
Citations:
3.7K