{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:20:54Z","timestamp":1742941254292,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700545"},{"type":"electronic","value":"9783031700552"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70055-2_23","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"377-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Entropy, Search Trajectories, and\u00a0Explainability for\u00a0Frequency Fitness Assignment"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6971-7817","authenticated-orcid":false,"given":"Sarah L.","family":"Thomson","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7649-5669","authenticated-orcid":false,"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5060-3342","authenticated-orcid":false,"given":"Daan","family":"van den Berg","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3732-4831","authenticated-orcid":false,"given":"Tianyu","family":"Liang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9687-8509","authenticated-orcid":false,"given":"Thomas","family":"Weise","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1109\/TEVC.2013.2251885","volume":"18","author":"T Weise","year":"2013","unstructured":"Weise, T., Wan, M., Wang, P., Tang, K., Devert, A., Yao, X.: Frequency fitness assignment. IEEE Trans. Evol. Comput. 18(2), 226\u2013243 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Weise, T., Li, X., Chen, Y., Wu, Z.: Solving job shop scheduling problems without using a bias for good solutions. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1459\u20131466 (2021)","DOI":"10.1145\/3449726.3463124"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Liang, T., Wu, Z., L\u00e4ssig, J., van\u00a0den Berg, D., Weise, T.: Solving the traveling salesperson problem using frequency fitness assignment. In: 2022 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 360\u2013367. IEEE (2022)","DOI":"10.1109\/SSCI51031.2022.10022296"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Liang, T., Wu, Z., L\u00e4ssig, J., van den Berg, D., Thomson, S.L., Weise, T.: Addressing the traveling salesperson problem with frequency fitness assignment and hybrid algorithms. Soft Comput. (2024, in press)","DOI":"10.1007\/s00500-024-09718-8"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-030-32236-6_51","volume-title":"Natural Language Processing and Chinese Computing","author":"F Xu","year":"2019","unstructured":"Xu, F., Uszkoreit, H., Du, Y., Fan, W., Zhao, D., Zhu, J.: Explainable AI: a brief survey on history, research areas, approaches and challenges. In: Tang, J., Kan, M.-Y., Zhao, D., Li, S., Zan, H. (eds.) NLPCC 2019. LNCS (LNAI), vol. 11839, pp. 563\u2013574. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32236-6_51"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Bacardit, J., Brownlee, A.E., Cagnoni, S., Iacca, G., McCall, J., Walker, D.: The intersection of evolutionary computation and explainable AI. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1757\u20131762 (2022)","DOI":"10.1145\/3520304.3533974"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Thomson, S.L., Adair, J., Brownlee, A.E., van\u00a0den Berg, D.: From fitness landscapes to explainable AI and back. In: Proceedings of the Companion Conference on Genetic and Evolutionary Computation, pp. 1663\u20131667 (2023)","DOI":"10.1145\/3583133.3596395"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"40","DOI":"10.3390\/a14020040","volume":"14","author":"KM Malan","year":"2021","unstructured":"Malan, K.M.: A survey of advances in landscape analysis for optimisation. Algorithms 14(2), 40 (2021)","journal-title":"Algorithms"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"van Stein, N., Vermetten, D., Kononova, A.V., B\u00e4ck, T.: Explainable benchmarking for iterative optimization heuristics. arXiv preprint arXiv:2401.17842 (2024)","DOI":"10.1145\/3638529.3654122"},{"key":"23_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107492","volume":"109","author":"G Ochoa","year":"2021","unstructured":"Ochoa, G., Malan, K.M., Blum, C.: Search trajectory networks: a tool for analysing and visualising the behaviour of metaheuristics. Appl. Soft Comput. 109, 107492 (2021)","journal-title":"Appl. Soft Comput."},{"key":"23_CR11","unstructured":"Sartori, C.C., Blum, C., Ochoa, G.: Large language models for the automated analysis of optimization algorithms. arXiv preprint arXiv:2402.08472 (2024)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica J. Econometric Soc. 53\u201376 (1957)","DOI":"10.2307\/1907742"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Drezner, Z., Hahn, P.M., Taillard, \u00c9.D.: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann. OR 139(1), 65\u201394 (2005). http:\/\/mistic.heig-vd.ch\/taillard\/articles.dir\/DreznerHT2005.pdf","DOI":"10.1007\/s10479-005-3444-z"},{"key":"23_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1998","unstructured":"Glover, F., Laguna, M.: Tabu Search. Springer, New York (1998). https:\/\/doi.org\/10.1007\/978-1-4615-6089-0"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1016\/j.amc.2018.11.052","volume":"347","author":"I Fister","year":"2019","unstructured":"Fister, I., Iglesias, A., Galvez, A., Del Ser, J., Osaba, E., Fister, I., Jr., Perc, M., Slavinec, M.: Novelty search for global optimization. Appl. Math. Comput. 347, 865\u2013881 (2019)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"23_CR16","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E Taillard","year":"1991","unstructured":"Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4), 443\u2013455 (1991)","journal-title":"Parallel Comput."},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.ejor.2005.01.066","volume":"174","author":"T St\u00fctzle","year":"2006","unstructured":"St\u00fctzle, T.: Iterated local search for the quadratic assignment problem. Eur. J. Oper. Res. 174(3), 1519\u20131539 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Gambardella, L.M., Taillard, \u00c9.D., Dorigo, M.: Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc. 50(2), 167\u2013176 (1999). http:\/\/mistic.heig-vd.ch\/taillard\/articles.dir\/GambardellaTD1999.pdf. Old technical report IDSIA-4-97","DOI":"10.1057\/palgrave.jors.2600676"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1090\/dimacs\/016\/08","volume":"16","author":"C Fleurent","year":"1993","unstructured":"Fleurent, C., Ferland, J.A., et al.: Genetic hybrids for the quadratic assignment problem. Quadratic Assign. Related Probl. 16, 173\u2013187 (1993)","journal-title":"Quadratic Assign. Related Probl."},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"DT Connolly","year":"1990","unstructured":"Connolly, D.T.: An improved annealing scheme for the QAP. Eur. J. Oper. Res. 46(1), 93\u2013100 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Forrest, S., Mitchell, M.: Relative building-block fitness and the building-block hypothesis. In: Foundations of Genetic Algorithms, vol.\u00a02, pp. 109\u2013126. Elsevier (1993)","DOI":"10.1016\/B978-0-08-094832-4.50013-1"},{"issue":"4598","key":"23_CR22","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Delahaye, D., Chaimatanan, S., Mongeau, M.: Simulated annealing: from basics to applications. In: Handbook of Metaheuristics, pp. 1\u201335 (2019)","DOI":"10.1007\/978-3-319-91086-4_1"},{"issue":"11","key":"23_CR24","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1109\/10.959324","volume":"48","author":"A Porta","year":"2001","unstructured":"Porta, A., et al.: Entropy, entropy rate, and pattern classification as tools to typify complexity in short heart period variability series. IEEE Trans. Biomed. Eng. 48(11), 1282\u20131291 (2001)","journal-title":"IEEE Trans. Biomed. Eng."},{"issue":"5","key":"23_CR25","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/LSP.2016.2542881","volume":"23","author":"M Rostaghi","year":"2016","unstructured":"Rostaghi, M., Azami, H.: Dispersion entropy: a measure for time-series analysis. IEEE Signal Process. Lett. 23(5), 610\u2013614 (2016)","journal-title":"IEEE Signal Process. Lett."},{"key":"23_CR26","unstructured":"Bromiley, P., Thacker, N., Bouhova-Thacker, E.: Shannon entropy, renyi entropy, and information. Stat. Inf. Ser. (2004-004) 9(2004), 2\u20138 (2004)"},{"issue":"3","key":"23_CR27","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1093\/biomet\/asv007","volume":"102","author":"S Giannerini","year":"2015","unstructured":"Giannerini, S., Maasoumi, E., Dagum, E.B.: Entropy testing for nonlinear serial dependence in time series. Biometrika 102(3), 661\u2013675 (2015)","journal-title":"Biometrika"},{"issue":"6","key":"23_CR28","doi-asserted-by":"publisher","first-page":"2297","DOI":"10.1073\/pnas.88.6.2297","volume":"88","author":"SM Pincus","year":"1991","unstructured":"Pincus, S.M.: Approximate entropy as a measure of system complexity. Proc. Nat. Acad. Sci. 88(6), 2297\u20132301 (1991)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"6","key":"23_CR29","doi-asserted-by":"publisher","first-page":"541","DOI":"10.3390\/e21060541","volume":"21","author":"A Delgado-Bonal","year":"2019","unstructured":"Delgado-Bonal, A., Marshak, A.: Approximate entropy and sample entropy: a comprehensive tutorial. Entropy 21(6), 541 (2019)","journal-title":"Entropy"},{"key":"23_CR30","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1023\/A:1015212328405","volume":"1","author":"F Beckers","year":"2001","unstructured":"Beckers, F., Ramaekers, D., Aubert, A.E.: Approximate entropy of heart rate variability: validation of methods and application in heart failure. Cardiovasc. Eng. Int. J. 1, 177\u2013182 (2001)","journal-title":"Cardiovasc. Eng. Int. J."},{"key":"23_CR31","unstructured":"Borchers, H.W., Borchers, M.H.W.: Package \u2018pracma\u2019. Practical numerical math functions, version 2(5) (2019)"},{"key":"23_CR32","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10439-012-0668-3","volume":"41","author":"JM Yentes","year":"2013","unstructured":"Yentes, J.M., Hunt, N., Schmid, K.K., Kaipust, J.P., McGrath, D., Stergiou, N.: The appropriate use of approximate entropy and sample entropy with short data sets. Ann. Biomed. Eng. 41, 349\u2013365 (2013)","journal-title":"Ann. Biomed. Eng."},{"issue":"3\u20134","key":"23_CR33","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1177\/1473871612455749","volume":"12","author":"H Gibson","year":"2013","unstructured":"Gibson, H., Faith, J., Vickers, P.: A survey of two-dimensional graph layout techniques for information visualisation. Inf. Vis. 12(3\u20134), 324\u2013357 (2013)","journal-title":"Inf. Vis."},{"key":"23_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-37623-2_28","volume-title":"Graph Drawing","author":"ER Gansner","year":"1998","unstructured":"Gansner, E.R., North, S.C.: Improved force-directed layouts. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 364\u2013373. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-37623-2_28"},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"Verel, S., Thomson, S., Rifki, O.: Where the really hard quadratic assignment problems are: the QAP-sat instances. arXiv preprint arXiv:2403.02783 (2024)","DOI":"10.1007\/978-3-031-57712-3_9"},{"key":"23_CR36","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1057\/palgrave.jors.2602068","volume":"57","author":"B Suman","year":"2006","unstructured":"Suman, B., Kumar, P.: A survey of simulated annealing as a tool for single and multiobjective optimization. J. Oper. Res. Soc. 57, 1143\u20131160 (2006)","journal-title":"J. Oper. Res. Soc."},{"key":"23_CR37","doi-asserted-by":"crossref","unstructured":"Nikolaev, A.G., Jacobson, S.H.: Simulated annealing. In: Handbook of Metaheuristics, pp. 1\u201339 (2010)","DOI":"10.1007\/978-1-4419-1665-5_1"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70055-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:05:43Z","timestamp":1725649543000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}