Abstract
Particle swarm optimization (PSO) is a nature-inspired technique originally designed for solving continuous optimization problems. There already exist several approaches that use PSO also as basis for solving discrete optimization problems, in particular the Traveling Salesperson Problem (TSP). In this paper, (i) we present the first theoretical analysis of a discrete PSO algorithm for TSP which also provides insight into the convergence behavior of the swarm. In particular, we prove that the popular choice of using “sequences of transpositions” as the difference between tours tends to decrease the convergence rate. (ii) In the light of this observation, we present a new notion of difference between tours based on “edge exchanges” and a new method to combine differences by computing their “centroid.” This leads to a more PSO-like behavior of the algorithm and avoids the observed slow down effect. (iii) Then, we investigate implementations of our methods and compare them with previous implementations showing the competitiveness of our new approaches.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anghinolfi, D., Paolucci, M.: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. European Journal of Operational Research 193, 73–85 (2009), doi:10.1016/j.ejor.2007.10.044
Clerc, M.: Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem. Website (2000), http://clerc.maurice.free.fr/pso/pso_tsp/Discrete_PSO_TSP.zip
Clerc, M.: Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: Onwubolu, G.C., Babu, B.V. (eds.) New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, pp. 219–239. Springer, Heidelberg (2004)
Clerc, M., Kennedy, J.: The particle swarm – Explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation 6, 58–73 (2002)
Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proc. 6th International Symposium on Micro Machine and Human Science, pp. 39–43 (1995)
Goldbarg, E.F.G., de Souza, G.R., Goldbarg, M.C.: Particle swarm for the traveling salesman problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 99–110. Springer, Heidelberg (2006)
Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol. 12. Springer, Heidelberg (2002)
Helwig, S., Wanka, R.: Theoretical analysis of initial particle swarm behavior. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 889–898. Springer, Heidelberg (2008)
Jiang, M., Luo, Y.P., Yang, S.Y.: Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm. Inf. Process. Lett. 102, 8–16 (2007)
Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13, 180–210 (1995)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics, vol. 5, pp. 4104–4108 (1997)
Reinelt, G.: TSPLIB – A traveling salesman problem library. ORSA Journal on Computing 3(4), 376–384 (1991)
Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf. Process. Lett. 103, 169–176 (2007)
Shi, X.H., Zhou, Y., Wang, L.M., Wang, Q.X., Liang, Y.C.: A discrete particle swarm optimization algorithm for travelling salesman problem. In: Proc. 1st Int. Conf. on Computation Methods (ICCM), vol. 2, pp. 1063–1068 (2004)
Solomon, A., Sutcliffe, P., Lister, R.: Sorting circular permutations by reversal. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 319–328. Springer, Heidelberg (2003)
Trelea, I.C.: The particle swarm optimization algorithm: Convergence analysis and parameter selection. Inf. Process. Lett. 85, 317–325 (2003)
Wang, K.P., Huang, L., Zhou, C.G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: Proc. 2nd Int. Conf. on Machine Learning and Cybernetics, vol. 3, pp. 1583–1585 (2003)
Zhong, W., Zhang, J., Chen, W.: A novel discrete particle swarm optimization to solve traveling salesman problem. In: Proc. IEEE Congress on Evolutionary Computation (CEC), pp. 3283–3287 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, M., Mühlenthaler, M., Helwig, S., Wanka, R. (2011). Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations. In: Bouchachia, A. (eds) Adaptive and Intelligent Systems. ICAIS 2011. Lecture Notes in Computer Science(), vol 6943. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23857-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-23857-4_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23856-7
Online ISBN: 978-3-642-23857-4
eBook Packages: Computer ScienceComputer Science (R0)