{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T18:33:56Z","timestamp":1790188436732,"version":"4.1.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030437213","type":"print"},{"value":"9783030437220","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43722-0_5","type":"book-chapter","created":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T23:04:05Z","timestamp":1586387045000},"page":"70-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Search Trajectory Networks of Population-Based Algorithms in Continuous Spaces"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7649-5669","authenticated-orcid":false,"given":"Gabriela","family":"Ochoa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6070-2632","authenticated-orcid":false,"given":"Katherine M.","family":"Malan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1736-3559","authenticated-orcid":false,"given":"Christian","family":"Blum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,9]]},"reference":[{"key":"5_CR1","unstructured":"Blum, C., Ochoa, G.: A comparative analysis of large neighborhood search and construct, merge, solve & adapt by means of merged local optima networks (submitted)"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization. ACM Comput. Surv. 35(3), 268\u2013308 (2003)","journal-title":"ACM Comput. Surv."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-09952-1_8","volume-title":"Swarm Intelligence","author":"P Bosman","year":"2014","unstructured":"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\u201397. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09952-1_8"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Chicano, F., Whitley, D., Ochoa, G., Tin\u00f3s, R.: Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 753\u2013760. ACM (2017)","DOI":"10.1145\/3071178.3071285"},{"key":"5_CR5","first-page":"1","volume":"1695","author":"G Csardi","year":"2006","unstructured":"Csardi, G., Nepusz, T.: The igraph software package for complex network research. Int. J. Complex Syst. 1695, 1\u20139 (2006)","journal-title":"Int. J. Complex Syst."},{"key":"5_CR6","unstructured":"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\u201343 (1995)"},{"key":"5_CR7","unstructured":"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\u201388 (2000)"},{"issue":"1\u20134","key":"5_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3233\/FI-1998-35123403","volume":"35","author":"AE Eiben","year":"1998","unstructured":"Eiben, A.E., Schippers, C.A.: On evolutionary exploration and exploitation. Fundam. Inform. 35(1\u20134), 35\u201350 (1998)","journal-title":"Fundam. Inform."},{"issue":"11","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper. 21(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exper."},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10732-017-9333-1","volume":"24","author":"S Herrmann","year":"2018","unstructured":"Herrmann, S., Ochoa, G., Rothlauf, F.: Pagerank centrality for performance prediction: the impact of the local optima network model. J. Heuristics 24(3), 243\u2013264 (2018)","journal-title":"J. Heuristics"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31(1), 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"5_CR12","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Joint Conference on Neural Networks, pp. 1942\u20131948 (1995)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.2139\/ssrn.924339"},{"key":"5_CR14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Tomassini, M., Verel, S., Darabos, C.: A study of NK landscapes\u2019 basins and local optima networks. In: Genetic and Evolutionary Computation Conference, GECCO, pp. 555\u2013562. ACM (2008)","DOI":"10.1145\/1389095.1389204"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-30698-8_5","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"G Ochoa","year":"2016","unstructured":"Ochoa, G., Veerapen, N.: Deconstructing the big valley search space hypothesis. In: Chicano, F., Hu, B., Garc\u00eda-S\u00e1nchez, P. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 58\u201373. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30698-8_5"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/CEC.2008.4630938"},{"key":"5_CR18","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-31306-0","volume-title":"Differential Evolution: A Practical Approach to Global Optimization","author":"KV Price","year":"2005","unstructured":"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\u2013533. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/3-540-31306-0"},{"key":"5_CR19","unstructured":"Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of the 1998 IEEE World Congress on Computational Intelligence, pp. 69\u201373 (1998)"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2013","unstructured":"S\u00f6rensen, K.: Metaheuristics-the metaphor exposed. Int. Trans. Oper. Res. 22(1), 3\u201318 (2013)","journal-title":"Int. Trans. Oper. Res."},{"key":"5_CR21","unstructured":"Storn, R., Price, K.: Minimizing the real functions of the ICEC\u201996 contest by differential evolution. In: Proceedings of the International Conference on Evolutionary Computation, pp. 842\u2013844 (1996)"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-030-16711-0_11","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"SL Thomson","year":"2019","unstructured":"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\u2013178. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16711-0_11"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1007\/978-3-319-45823-6_93","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"N Veerapen","year":"2016","unstructured":"Veerapen, N., Ochoa, G., Tin\u00f3s, R., Whitley, D.: Tunnelling crossover networks for the asymmetric TSP. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 994\u20131003. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_93"},{"issue":"6","key":"5_CR24","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1109\/TEVC.2010.2046175","volume":"15","author":"S Verel","year":"2011","unstructured":"Verel, S., Ochoa, G., Tomassini, M.: Local optima networks of NK landscapes with neutrality. IEEE Trans. Evol. Comput. 15(6), 783\u2013797 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"5_CR25","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82\u2013102 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43722-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T20:18:07Z","timestamp":1614889087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43722-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030437213","9783030437220"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43722-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seville","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.68","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.25","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}