{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:41:18Z","timestamp":1742928078897,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"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_38","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"548-561","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of\u00a0Search Landscape Samplers for\u00a0Solver Performance Prediction on\u00a0a\u00a0University Timetabling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0854-3176","authenticated-orcid":false,"given":"Thomas","family":"Feutrier","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4372-5162","authenticated-orcid":false,"given":"Marie-\u00c9l\u00e9onore","family":"Kessaci","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3699-1080","authenticated-orcid":false,"given":"Nadarajen","family":"Veerapen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","unstructured":"Bischl, B., Mersmann, O., Trautmann, H., Preu\u00df, M.: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, GECCO 2012, pp. 313\u2013320. Association for Computing Machinery, New York (2012). https:\/\/doi.org\/10.1145\/2330163.2330209","DOI":"10.1145\/2330163.2330209"},{"issue":"4","key":"38_CR2","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1162\/EVCO_a_00193","volume":"25","author":"F Daolio","year":"2017","unstructured":"Daolio, F., Liefooghe, A., Verel, S., Aguirre, H., Tanaka, K.: Problem features vs. algorithm performance on rugged multiobjective combinatorial fitness landscapes. Evol. Comput. 25(4), 555\u2013585 (2017). https:\/\/doi.org\/10.1162\/EVCO_a_00193","journal-title":"Evol. Comput."},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Feutrier, T., Kessaci, M.E., Veerapen, N.: Exploiting landscape features for fitness prediction in university timetabling. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2022. Association for Computing Machinery, New York (2022, [accepted as poster paper])","DOI":"10.1145\/3520304.3528910"},{"key":"38_CR4","doi-asserted-by":"publisher","unstructured":"Jankovic, A., Doerr, C.: Landscape-aware fixed-budget performance regression and algorithm selection for modular cma-es variants. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 841\u2013849. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3377930.3390183","DOI":"10.1145\/3377930.3390183"},{"key":"38_CR5","unstructured":"Kohavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, IJCAI 1995, vol. 2, pp. 1137\u20131143. Morgan Kaufmann Publishers Inc., San Francisco (1995)"},{"issue":"1","key":"38_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R Lewis","year":"2008","unstructured":"Lewis, R.: A survey of metaheuristic-based techniques for University Timetabling problems. OR Spect. 30(1), 167\u2013190 (2008). https:\/\/doi.org\/10.1007\/s00291-007-0097-0","journal-title":"OR Spect."},{"issue":"6","key":"38_CR7","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1109\/TEVC.2019.2940828","volume":"24","author":"A Liefooghe","year":"2020","unstructured":"Liefooghe, A., Daolio, F., Verel, S., Derbel, B., Aguirre, H., Tanaka, K.: Landscape-aware performance prediction for evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 24(6), 1063\u20131077 (2020). https:\/\/doi.org\/10.1109\/TEVC.2019.2940828","journal-title":"IEEE Trans. Evol. Comput."},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ins.2013.04.015","volume":"241","author":"KM Malan","year":"2013","unstructured":"Malan, K.M., Engelbrecht, A.P.: A survey of techniques for characterising fitness landscapes and some possible ways forward. Inf. Sci. 241, 148\u2013163 (2013). https:\/\/doi.org\/10.1016\/j.ins.2013.04.015","journal-title":"Inf. Sci."},{"key":"38_CR9","doi-asserted-by":"publisher","unstructured":"Malan, K.M., Engelbrecht, A.P.: Particle swarm optimisation failure prediction based on fitness landscape characteristics. In: 2014 IEEE Symposium on Swarm Intelligence, pp. 1\u20139 (2014). https:\/\/doi.org\/10.1109\/SIS.2014.7011789","DOI":"10.1109\/SIS.2014.7011789"},{"key":"38_CR10","doi-asserted-by":"publisher","unstructured":"Malan, K.M.: A survey of advances in landscape analysis for optimisation. Algorithms 14(2) (2021). https:\/\/doi.org\/10.3390\/a14020040","DOI":"10.3390\/a14020040"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-32937-1_23","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"MA Mu\u00f1oz","year":"2012","unstructured":"Mu\u00f1oz, M.A., Kirley, M., Halgamuge, S.K.: A meta-learning prediction model of algorithm performance for continuous optimization problems. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012. LNCS, vol. 7491, pp. 226\u2013235. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32937-1_23"},{"issue":"1","key":"38_CR12","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T M\u00fcller","year":"2009","unstructured":"M\u00fcller, T.: ITC2007 solver description: a hybrid approach. Ann. Oper. Res. 172(1), 429\u2013446 (2009). https:\/\/doi.org\/10.1007\/s10479-009-0644-y","journal-title":"Ann. Oper. Res."},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Qu, R., Burke, E.K.: Analyzing the landscape of a graph based hyper-heuristic for timetabling problems. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2009) (2009)","DOI":"10.1145\/1569901.1569949"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-319-55453-2_16","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"G Ochoa","year":"2017","unstructured":"Ochoa, G., Veerapen, N., Daolio, F., Tomassini, M.: Understanding phase transitions with local optima networks: number partitioning as a case study. In: Hu, B., L\u00f3pez-Ib\u00e1\u00f1ez, M. (eds.) EvoCOP 2017. LNCS, vol. 10197, pp. 233\u2013248. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55453-2_16"},{"key":"38_CR15","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-41888-4_9","volume-title":"Recent Advances in the Theory and Application of Fitness Landscapes","author":"G Ochoa","year":"2014","unstructured":"Ochoa, G., Verel, S., Daolio, F., Tomassini, M.: Local optima networks: a new model of combinatorial fitness landscapes. In: Richter, H., Engelbrecht, A. (eds.) Recent Advances in the Theory and Application of Fitness Landscapes. ECC, vol. 6, pp. 233\u2013262. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-41888-4_9"},{"key":"38_CR16","unstructured":"PATAT: International Timetabling Competition 2007 (2007). publication Title: International Timetabling Competition"},{"issue":"1","key":"38_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-014-1688-1","volume":"239","author":"N Pillay","year":"2014","unstructured":"Pillay, N.: A review of hyper-heuristics for educational timetabling. Ann. Oper. Res. 239(1), 3\u201338 (2014). https:\/\/doi.org\/10.1007\/s10479-014-1688-1","journal-title":"Ann. Oper. Res."},{"key":"38_CR18","unstructured":"Salwani, A.: On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems - ScienceDirect (2012)"},{"key":"38_CR19","doi-asserted-by":"publisher","unstructured":"Stadler, P.F.: Fitness landscapes. In: L\u00e4ssig, M., Valleriani, A. (eds.) Biological Evolution and Statistical Physics, Lecture Notes in Physics, pp. 183\u2013204. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45692-9_10","DOI":"10.1007\/3-540-45692-9_10"},{"issue":"4","key":"38_CR20","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1162\/evco\\_a_00271","volume":"28","author":"SL Thomson","year":"2020","unstructured":"Thomson, S.L., Ochoa, G., Verel, S., Veerapen, N.: Inferring future landscapes: sampling the local optima level. Evol. Comput. 28(4), 621\u2013641 (2020). https:\/\/doi.org\/10.1162\/evco_a_00271","journal-title":"Evol. Comput."},{"key":"38_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.066114","volume":"78","author":"M Tomassini","year":"2008","unstructured":"Tomassini, M., Verel, S., Ochoa, G.: Complex-network analysis of combinatorial spaces: the $$nk$$ landscape case. Phys. Rev. E 78, 066114 (2008). https:\/\/doi.org\/10.1103\/PhysRevE.78.066114","journal-title":"Phys. Rev. E"},{"issue":"6","key":"38_CR22","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). https:\/\/doi.org\/10.1109\/TEVC.2010.2046175","journal-title":"IEEE Trans. Evol. Comput."}],"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_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:46:14Z","timestamp":1710261974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_38","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)"}}]}}