{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T17:46:12Z","timestamp":1745343972789,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147135"},{"type":"electronic","value":"9783031147142"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14714-2_37","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"533-547","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Analysing the\u00a0Fitness Landscape Rotation for\u00a0Combinatorial Optimisation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7644-9993","authenticated-orcid":false,"given":"Joan","family":"Alza","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3383-4100","authenticated-orcid":false,"given":"Mark","family":"Bartlett","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7120-6338","authenticated-orcid":false,"given":"Josu","family":"Ceberio","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1738-7056","authenticated-orcid":false,"given":"John","family":"McCall","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Alza, J., Bartlett, M., Ceberio, J., McCall, J.: On the definition of dynamic permutation problems under landscape rotation. In: Proceedings of GECCO, pp. 1518\u20131526 (2019)","DOI":"10.1145\/3319619.3326840"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Alza, J., Bartlett, M., Ceberio, J., McCall, J.: Towards the landscape rotation as a perturbation strategy on the quadratic assignment problem. In: Proceedings of GECCO, pp. 1405\u20131413 (2021)","DOI":"10.1145\/3449726.3463139"},{"key":"37_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0911-0","volume-title":"Evolutionary Optimization in Dynamic Environments","author":"J Branke","year":"2002","unstructured":"Branke, J.: Evolutionary Optimization in Dynamic Environments. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-1-4615-0911-0"},{"key":"37_CR4","unstructured":"Ceberio, J.: Solving Permutation Problems with Estimation of Distribution Algorithms and Extensions Thereof. Ph.D. thesis, UPV\/EHU (2014)"},{"issue":"3","key":"37_CR5","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.ejor.2014.09.041","volume":"241","author":"J Ceberio","year":"2015","unstructured":"Ceberio, J., Mendiburu, A., Lozano, J.A.: The linear ordering problem revisited. EJOR 241(3), 686\u2013696 (2015)","journal-title":"EJOR"},{"key":"37_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"4","key":"37_CR7","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1162\/EVCO_a_00100","volume":"21","author":"L Hernando","year":"2013","unstructured":"Hernando, L., Mendiburu, A., Lozano, J.A.: An evaluation of methods for estimating the number of local optima in combinatorial optimization problems. Evol. Comput. 21(4), 625\u2013658 (2013)","journal-title":"Evol. Comput."},{"issue":"3","key":"37_CR8","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1162\/evco_a_00227","volume":"27","author":"L Hernando","year":"2019","unstructured":"Hernando, L., Mendiburu, A., Lozano, J.A.: Anatomy of the attraction basins: breaking with the intuition. Evol. Comput. 27(3), 435\u2013466 (2019)","journal-title":"Evol. Comput."},{"key":"37_CR9","unstructured":"Irurozki, E.: Sampling and learning distance-based probability models for permutation spaces. Ph.D. thesis, UPV\/EHU (2014)"},{"key":"37_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16729-4","volume-title":"The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization","author":"R Mart\u00ed","year":"2011","unstructured":"Mart\u00ed, R., Reinelt, G.: The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization, vol. 175. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-16729-4"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Mavrovouniotis, M., Yang, S., Yao, X.: A benchmark generator for dynamic permutation-encoded problems. In: PPSN, pp. 508\u2013517 (2012)","DOI":"10.1007\/978-3-642-32964-7_51"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.05.001","volume":"6","author":"TT Nguyen","year":"2012","unstructured":"Nguyen, T.T., Yang, S., Branke, J.: Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evol. Comput. 6, 1\u201324 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"107492","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":"37_CR14","unstructured":"Reidys, C.M., Stadler, P.F.: Combinatorial Landscapes. Working Papers 01\u201303-014, Santa Fe Institute (2001)"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Tayarani-N., M.H., Pr\u00fcgel-Bennett, A.: On the landscape of combinatorial optimization problems. IEEE TEVC 18(3), 420\u2013434 (2014)","DOI":"10.1109\/TEVC.2013.2281502"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ins.2014.05.053","volume":"282","author":"R Tin\u00f3s","year":"2014","unstructured":"Tin\u00f3s, R., Yang, S.: Analysis of fitness landscape modifications in evolutionary dynamic optimization. Inf. Sci. 282, 214\u2013236 (2014)","journal-title":"Inf. Sci."},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-35533-2_5","volume-title":"Artificial Evolution","author":"S V\u00e9rel","year":"2012","unstructured":"V\u00e9rel, S., Daolio, F., Ochoa, G., Tomassini, M.: Local optima networks with escape edges. In: Hao, J.-K., Legrand, P., Collet, P., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2011. LNCS, vol. 7401, pp. 49\u201360. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35533-2_5"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Yang, S.: Non-stationary problem optimization using the primal-dual genetic algorithm. In: Proceedings of CEC, vol. 3, pp. 2246\u20132253 (2003)","DOI":"10.1109\/CEC.2003.1299951"},{"key":"37_CR19","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s00500-004-0422-3","volume":"9","author":"S Yang","year":"2005","unstructured":"Yang, S., Yao, X.: Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput. 9, 815\u2013834 (2005)","journal-title":"Soft Comput."},{"issue":"4","key":"37_CR20","first-page":"630","volume":"25","author":"D Yazdani","year":"2021","unstructured":"Yazdani, D., Cheng, R., Yazdani, D., Branke, J., Jin, Y., Yao, X.: A survey of evolutionary continuous dynamic optimization over two decades-part b. IEEE TEVC 25(4), 630\u2013650 (2021)","journal-title":"IEEE TEVC"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Younes, A., Calamai, P., Basir, O.: Generalized benchmark generation for dynamic combinatorial problems. In: Proceedings of GECCO, pp. 25\u201331 (2005)","DOI":"10.1145\/1102256.1102262"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14714-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T17:49:24Z","timestamp":1727804964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","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":"185","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":"85","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":"46% - 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":"3.75","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":"3.11","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)"}}]}}