Abstract
In this paper we propose a Swarm-based Spreading Points algorithm (SSP) for improving the solutions for packing problems. The SSP repositions the initial set of points and evolves it to improve the minimum distance between points. During the evolving process, for each point, a feasible direction of movement is computed according to its nearest neighbors so that the shortest pairwise distance between the point and other points can be increased along this direction (if any). Our experiments showed that the SSP algorithm can improve certain best-known solutions for some problems previously reported in the literature.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The check program is available for download at http://huangxiangyang.ie.cnu.edu.cn/papers/checkpackings.rar.
References
Croft, H.T., Falconer, K.J., Guy, R.K.: Unsolved Problems in Geometry: Unsolved Problems in Intuitive Mathematics. Springer Science & Business Media, New York (2012)
Hifi, M., M’hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Adv. Oper. Res. 2009(4), 22 (2009)
Castillo, I., Kampas, F.J., Pintér, J.D.: Solving circle packing problems by global optimization: numerical results and industrial applications. Eur. J. Oper. Res. 191(3), 786–802 (2008)
Cabello, S.: Approximation algorithms for spreading points. J. Algorithms 62(2), 49–73 (2007)
Horst, R., Thoai, N.V.: DC Programming overview. J. of Optim. Theory Appl. 103, 1–43 (1999)
Raber, U.: Nonconvex All-quadratic global optimization problems: solution methods, applications, and related topics. Ph.D. thesis, University of Trier, Germany (1999)
Mladenović, N., Plastria, F., Urošević, D.: Reformulation descent applied to circle packing problems. Comput. Oper. Res. 32(9), 2419–2434 (2005)
M’Hallah, R., Alkandari, A., Mladenovic, N.: Packing unit spheres into the smallest sphere using VNS and NLP. Comput. Oper. Res. 40(2), 603–615 (2013)
Tan, Y., Shi, Y., Niu, B. (eds.): ICSI 2016. LNCS, vol. 9712. Springer, Heidelberg (2016)
Boll, D.W., Donovan, J., Graham, R.L., et al.: Improving dense packings of equal disks in a square[J]. Electron. J. Com. 7(1), R46 (2000)
Szabó, P.G., Markót, M.C., Csendes, T.: Global Optimization in Geometry—Circle Packing into the Square: Essays and Surveys in Global Optimization, pp. 233–265. Springer, US (2005)
Dantzig, G.B., Orden, A., Wolfe, P.: The generalized simplex method for minimizing a linear form under linear inequality restraints. Pac. J. Math. 5(2), 183–195 (1955)
Addis, B., Locatelli, M., Schoen, F.: Disk packing in a square: a new global optimization approach. INFORMS J. Comput. 20(4), 516–524 (2008)
Huang, W., Ye, T.: Greedy vacancy search algorithm for packing equal circles in a square. Oper. Res. Lett. 38(5), 378–382 (2010)
Acknowledgments
Part of this work was developed while Xiangyang Huang worked in Professor LiGuo Huang’s research group as a visiting scholar at Southern Methodist University. This work was supported in part by National Natural Science Foundation of China under Grants 61371194, 61672361 and 61402033, and Beijing Natural Science Foundation under Grant 4152012.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Appendix
Appendix
Given a predefined calculation precision, SSP is convergent. A proof of the convergence is given below.
Let c be an n-dimensional vector and the arrangement of its elements, from its first element denoted by c [1] to the last c[n], corresponds to the arrangement of d i for all n points ordered by ascend, i.e., c[i] ≤ c[i + 1] for any 1 ≤ i ≤ n-1. Given a specified calculation precision and the number of points n, the set of c, denoted by C, is bounded (finite). The inequality c 1 > c 2 holds if and only if there exists an integer i (1 ≤ i≤n) such that c 1[j] ≥ c 2[j] ∀j < i and c 1[i] > c 2[i] where c 1, c 2∈C.
Let c t and c t+1∈C be arrangements of shortest pairwise distances for n points at iterations t and t + 1 respectively. The elements in c t and c t+1 are ordered by ascend.
Convergence.
Let t be the current iteration and t + 1 be the iteration after movement of a point p i (suppose the position index of the point p i is also i in c t ). When the point p i moves along the direction r i (t), for any point p k in the nearest neighbors n i (t) of p i , the d k does not decrease (increases if the point p i also belongs to n k (t)); for other points p j (p j is not in n i (t)), let d ij be the distance from the point p i to the point p j , and then \( d_{ij} \ge d_{i}^{ + } \) according to the definition of \( d_{i}^{ + } \). After the point p i moves a step \( a\left( {d_{i}^{ + } - d_{i} } \right) \) from iteration t to t + 1, the distance \( d_{ij} \left( {t + 1} \right) \, \ge d_{i}^{ + } \left( t \right) - a\left( {d_{i}^{ + } \left( t \right) - d_{i} \left( t \right)} \right) > d_{i} \left( t \right) \) since a is less than 1. So for p j , if d j (t) ≤ d i (t) at iteration t, d j (t + 1) does not change at iteration t + 1 since d ij (t + 1) > d i (t) and the point p i does not become a neighbor of p j at iteration t + 1. If d j (t) > d i (t) at iteration t, d j (t + 1) is still larger than d i (t) at iteration t + 1 even though the movement of the point p i affects d j (i.e., the point p i becomes a nearest neighbor of the point p j at iteration t + 1). In summary, (1) for the point p u , the position of which in c t is before that of the point p i (d u (t) ≤ d i (t)), the d u (t + 1) does not decrease at iteration t + 1; (2) for the point p v , the position of which in c t is after that of the point p i (d v (t) > d i (t)), the d v (t + 1) is still larger than d i (t); (3) for the point p i , its d i (t + 1) increases. Hence c t+1 increases according to the above definition when there exists any movable point. Because C is bounded (finite), c t will converge with t → ∞.
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Huang, X., Huang, L., Zhang, S., Zhou, L. (2017). Swarm-Based Spreading Points. In: Tan, Y., Takagi, H., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2017. Lecture Notes in Computer Science(), vol 10386. Springer, Cham. https://doi.org/10.1007/978-3-319-61833-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-61833-3_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61832-6
Online ISBN: 978-3-319-61833-3
eBook Packages: Computer ScienceComputer Science (R0)