Abstract
We introduce search trajectory networks (STNs) as a tool to analyse and visualise the behaviour of population-based algorithms in continuous spaces. Inspired by local optima networks (LONs) that model the global structure of search spaces, STNs model the search trajectories of algorithms. Unlike LONs, the nodes of the network are not restricted to local optima but instead represent a given state of the search process. Edges represent search progression between consecutive states. This extends the power and applicability of network-based models to understand heuristic search algorithms. We extract and analyse STNs for two well-known population-based algorithms: particle swarm optimisation and differential evolution when applied to benchmark continuous optimisation problems. We also offer a comparative visual analysis of the search dynamics in terms of merged search trajectory networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Blum, C., Ochoa, G.: A comparative analysis of large neighborhood search and construct, merge, solve & adapt by means of merged local optima networks (submitted)
Blum, C., Roli, A.: Metaheuristics in combinatorial optimization. ACM Comput. Surv. 35(3), 268–308 (2003)
Bosman, P., Engelbrecht, A.P.: Diversity rate of change measurement for particle swarm optimisers. In: Dorigo, M., et al. (eds.) ANTS 2014. LNCS, vol. 8667, pp. 86–97. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-09952-1_8
Chicano, F., Whitley, D., Ochoa, G., Tinós, R.: Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 753–760. ACM (2017)
Csardi, G., Nepusz, T.: The igraph software package for complex network research. Int. J. Complex Syst. 1695, 1–9 (2006)
Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micromachine and Human Science, pp. 39–43 (1995)
Eberhart, R., Shi, Y.: Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation, vol. 1, pp. 84–88 (2000)
Eiben, A.E., Schippers, C.A.: On evolutionary exploration and exploitation. Fundam. Inform. 35(1–4), 35–50 (1998)
Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper. 21(11), 1129–1164 (1991)
Herrmann, S., Ochoa, G., Rothlauf, F.: Pagerank centrality for performance prediction: the impact of the local optima network model. J. Heuristics 24(3), 243–264 (2018)
Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31(1), 7–15 (1989)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Joint Conference on Neural Networks, pp. 1942–1948 (1995)
Mishra, S.K.: Performance of repulsive particle swarm method in global optimization of some important test functions: a Fortran program. Technical report, Social Science Research Network (SSRN), August 2006
Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)
Ochoa, G., Tomassini, M., Verel, S., Darabos, C.: A study of NK landscapes’ basins and local optima networks. In: Genetic and Evolutionary Computation Conference, GECCO, pp. 555–562. ACM (2008)
Ochoa, G., Veerapen, N.: Deconstructing the big valley search space hypothesis. In: Chicano, F., Hu, B., GarcÃa-Sánchez, P. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 58–73. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30698-8_5
Olorunda, O., Engelbrecht, A.P.: Measuring exploration/exploitation in particle swarms using swarm diversity. In: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence). IEEE, June 2008
Price, K.V., Storn, R.M., Lampinen, J.A.: Appendix A.1: Unconstrained uni-modal test functions. In: Price, K.V., Storn, R.M., Lampinen, J.A. (eds.) Differential Evolution: A Practical Approach to Global Optimization. Natural Computing Series, pp. 514–533. Springer, Berlin (2005). https://doi.org/10.1007/3-540-31306-0
Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of the 1998 IEEE World Congress on Computational Intelligence, pp. 69–73 (1998)
Sörensen, K.: Metaheuristics-the metaphor exposed. Int. Trans. Oper. Res. 22(1), 3–18 (2013)
Storn, R., Price, K.: Minimizing the real functions of the ICEC’96 contest by differential evolution. In: Proceedings of the International Conference on Evolutionary Computation, pp. 842–844 (1996)
Thomson, S.L., Ochoa, G., Verel, S.: Clarifying the difference in local optima network sampling algorithms. In: Liefooghe, A., Paquete, L. (eds.) EvoCOP 2019. LNCS, vol. 11452, pp. 163–178. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-16711-0_11
Veerapen, N., Ochoa, G., Tinós, R., Whitley, D.: Tunnelling crossover networks for the asymmetric TSP. In: Handl, J., Hart, E., Lewis, P.R., López-Ibáñez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 994–1003. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45823-6_93
Verel, S., Ochoa, G., Tomassini, M.: Local optima networks of NK landscapes with neutrality. IEEE Trans. Evol. Comput. 15(6), 783–797 (2011)
Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82–102 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Ochoa, G., Malan, K.M., Blum, C. (2020). Search Trajectory Networks of Population-Based Algorithms in Continuous Spaces. In: Castillo, P.A., Jiménez Laredo, J.L., Fernández de Vega, F. (eds) Applications of Evolutionary Computation. EvoApplications 2020. Lecture Notes in Computer Science(), vol 12104. Springer, Cham. https://doi.org/10.1007/978-3-030-43722-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-43722-0_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43721-3
Online ISBN: 978-3-030-43722-0
eBook Packages: Computer ScienceComputer Science (R0)