Abstract
The classical Particle Swarm Optimization is a powerful method to find the minimum of a numerical function, on a continuous definition domain. As some binary versions have already successfully been used, it seems quite natural to try to define a framework for a discrete PSO. In order to better understand both the power and the limits of this approach, we examine in detail how it can be used to solve the well known Traveling Salesman Problem, which is in principle very “bad” for this kind of optimization heuristic. Results show Discrete PSO is certainly not as powerful as some specific algorithms, but, on the other hand, it can easily be modified for any discrete/combinatorial problem for which we have no good specialized algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kennedy J., “Small Worlds and Mega-Minds: Effects of Neighborhood Topology on Particle Swarm Performance”, Congress on Evolutionary Computation,Washington D.C., 1999, p. 1931–1938.
Angeline P. J., “Using Selection to Improve Particle Swarm Optimization”, IEEE International Conference on Evolutionary Computation,Anchorage, Alaska, May 1998, p. 84–89.
Eberhart R. C., Kennedy J., “A New Optimizer Using Particle Swarm Theory”, Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995, p. 39–43.
Kennedy J., Eberhart R. C., “Particle Swarm Optimization”, IEEE International Conference on Neural Networks, Perth, Australia, 1995, p. 1942–1948.
Kennedy J., “The Particle Swarm: Social Adaptation of Knowledge”, International Conference on Evolutionary Computation, Indianapolis, Indiana, 1997, p. 303–308.
Kennedy J., “The behavior of particles”, Evolutionary VII, San Diego, CA, 1998, p. 581–589.
Shi Y., Eberhart R. C., “Parameter Selection in Particle Swarm Optimization”, Evolutionary Programming VII,1998
Shi Y. H., Eberhart R. C., “A Modified Particle Swarm Optimizer”, International Conference on Evolutionary Computation, Anchorage, Alaska, May 4–9, 1998, p. 69–73.
Clerc M., “The Swarm and the Queen: Towards a Deterministic and Adaptive Particle Swarm Optimization”, Congress on Evolutionary Computation,Washington DC, 1999, p. 1951–1955.
Clerc M., Kennedy J., “The Particle Swarm-Explosion, Stability, and Convergence in a Multidimensional Complex Space”, IEEE Transactions on Evolutionary Computation, vol. 6, 1, 2002, p. 58–73.
Helsgaun K., An Effective Implementation of the Lin-Kemighan Traveling Salesman Heuristic, Department of Computer Science,Roskilde University, Denmark, 1997.
Wolpert D. H., Macready W. G., No Free Lunch for Search, The Santa Fe Institute, 1995.
Kennedy J., Eberhart R. C., “A discrete binary version of the particle swarm algorithm”, Conference on Systems, Man, and Cybernetics, 1997, p. 4104–4109.
Yoshida H., Kawata K., Fukuyama Y., “A Particle Swarm Optimization for Reactive Power and Voltage Control considering Voltage Security Assessment”, IEEE Trans. on Power Systems, vol. 15, 4, 2001, p. 1232–1239.
Secrest B. R., Lamont G. B., “Communication in Particle Swarm Optimization Illustrated by the Travelling Salesman Problem”, Workshop on Particle Swarm Optimization,Indianapolis, IN: Purdue School of Engineering and Technology, 2001
He Z., Wei C., Jin B., Pei W., Yang L., “A New Population-based Incremental Learning Method for the Traveling Salesman Problem”, Congress on Evolutionary Computation, Washington D.C., 1999, p. 1152–1156.
Kennedy J., “Stereotyping: Improving Particle Swarm Performance With Cluster Analysis”, Congress on Evolutionary Computation, 2000, p. 1507–1512.
Coello Coello C. A., Toscano Pulido G., Lechuga M. S., Handling Multiple Objectives with Particle Swarm Optimization, EVOCINV-02–2002, CINVESTAV, Evolutionary Computation Group, 2002.
Hu X., Eberhart R. C., “Multiobjective Optimization Using Dynamic Neighborhood Particle Swarm Optimization”, Congress on Evolutionary Computation (CEC2002), Piscataway, New Jersey, 2002, p. 1677–1681.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Clerc, M. (2004). Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem. In: New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, vol 141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39930-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-39930-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05767-0
Online ISBN: 978-3-540-39930-8
eBook Packages: Springer Book Archive