A hybrid algorithm for packing identical spheres into a container

作者：

Highlights：

• The identical sphere packing problem is studied.

• A new hybrid PSO is proposed for approximately solving the problem.

• At each iteration, a continuous optimization is used for repairing the solution.

• The continuous optimization is used for improving the quality of the solutions.

• The new method yields new bounds on benchmark instances of the literature.

摘要

•The identical sphere packing problem is studied.•A new hybrid PSO is proposed for approximately solving the problem.•At each iteration, a continuous optimization is used for repairing the solution.•The continuous optimization is used for improving the quality of the solutions.•The new method yields new bounds on benchmark instances of the literature.

论文关键词：Heuristic,Optimization,Packing,Swarm

论文评审过程：Received 22 June 2017, Revised 26 November 2017, Accepted 27 November 2017, Available online 5 December 2017, Version of Record 22 December 2017.

论文官网地址：https://doi.org/10.1016/j.eswa.2017.11.052