.png){kind=icon}
.png){kind=icon}
Return
A threshold search-based population algorithm for the sphere packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2022.110177.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Cutting and packing problems occur in various real-world applications, like manufacturing, production process, automated planning, logistics, and material industries. Most of these problems are NP-hard combinatorial optimization problems and their resolution is computationally challenging. In this paper, we study a problem belonging to this family, namely the three-dimensional sphere packing problem. We propose to solve it with a population-based method, where both a reference set of solutions cooperates with a threshold operator for guiding the search process. The reference set tries to maintain the diversity of the solutions reached throughout an iterative procedure while the threshold operator tries to highlight the quality of the solutions throughout the search process. The performance of the proposed method is evaluated on benchmark instances of the literature, where its provided results are compared to those reached by some available methods in the literature. The designed method seems competitive, where it is able to achieve new bounds for several tested instances.(c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Optimization
Packing
Swarm
Tolerance
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W