Abstract
This paper proposes variants of the angle modulated particle swarm optimization (AMPSO) algorithm. A number of limitations of the original AMPSO algorithm are identified and the proposed variants aim to remove these limitations. The new variants are then compared to AMPSO on a number of binary problems in various dimensions. It is shown that the performance of the variants is superior to AMPSO in many problem cases. This indicates that the identified limitations may have a significant effect on performance, but that the effects can be overcome by removing those limitations. It is also observed that the ability of the variants to initialize a wider range of potential solutions can be helpful during the search process.
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
Balaprakash, P., Birattari, M., Stützle, T.: Improvement strategies for the f-race algorithm: Sampling design and iterative refinement. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI/ICCV 2007. LNCS, vol. 4771, pp. 108–122. Springer, Heidelberg (2007)
Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Genetic and Evolutionary Computation Conference, pp. 11–18 (2002)
Dirakkhunakon, S., Suansook, Y.: Simulated annealing with iterative improvement. In: International Conference on Signal Processing Systems, pp. 302–306 (2009)
Engelbrecht, A.: Particle swarm optimization: Velocity initialization. In: IEEE Congress on Evolutionary Computation, pp. 1–8 (2012)
Fisher, D.: On the nxn knight cover problem. Ars Combinatoria 69, 255–274 (2003)
Goldberg, D.: Simple genetic algorithms and the minimal, deceptive problem. In: Genetic Algorithms and Simulated Annealing, p. 88 (1987)
Gordon, V., Slocum, T.: The knight’s tour - evolutionary vs. depth-first search. In: IEEE Congress on Evolutionary Computation, vol. 2, pp. 1435–1440 (2004)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)
Kennedy, J., Eberhart, R.: A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, vol. 5, pp. 4104–4108 (1997)
Liu, L., Liu, W., Cartes, D., Chung, I.: Slow coherency and angle modulated particle swarm optimization based islanding of large-scale power systems. Advanced Engineering Informatics 23(1), 45–56 (2009)
Martinjak, I., Golub, M.: Comparison of heuristic algorithms for the n-queen problem. In: 29th International Conference on Information Technology Interfaces, pp. 759–764 (2007)
Pampara, G.: Angle Modulated Population Based Algorithms to solve Binary Problems. Master’s thesis, University of Pretoria (2013)
Pampara, G., Franken, N., Engelbrecht, A.: Combining particle swarm optimisation with angle modulation to solve binary problems. In: IEEE Congress on Evolutionary Computation, vol. 1, pp. 89–96 (2005)
Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 69–73. IEEE (2002)
Turky, A., Ahmad, A.: Using genetic algorithm for solving n-queens problem. In: International Symposium in Information Technology, vol. 2, pp. 745–747 (2010)
Wang, S., Watada, J., Pedrycz, W.: Value-at-risk-based two-stage fuzzy facility location problems. IEEE Transactions on Industrial Informatics, 465–482 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Leonard, B.J., Engelbrecht, A.P. (2014). Angle Modulated Particle Swarm Variants. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2014. Lecture Notes in Computer Science, vol 8667. Springer, Cham. https://doi.org/10.1007/978-3-319-09952-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-09952-1_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09951-4
Online ISBN: 978-3-319-09952-1
eBook Packages: Computer ScienceComputer Science (R0)