{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T01:00:51Z","timestamp":1775610051828,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031024610","type":"print"},{"value":"9783031024627","type":"electronic"}],"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-02462-7_9","type":"book-chapter","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T23:02:49Z","timestamp":1649977369000},"page":"124-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The Asteroid Routing Problem: A Benchmark for Expensive Black-Box Permutation Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9974-1295","authenticated-orcid":false,"given":"Manuel","family":"L\u00f3pez-Ib\u00e1\u00f1ez","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1259-2990","authenticated-orcid":false,"given":"Francisco","family":"Chicano","sequence":"additional","affiliation":[]},{"given":"Rodrigo","family":"Gil-Merino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,15]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.asoc.2017.01.039","volume":"55","author":"T Bartz-Beielstein","year":"2017","unstructured":"Bartz-Beielstein, T., Zaefferer, M.: Model-based methods for continuous and discrete global optimization. Appl. Soft Comput. 55, 154\u2013167 (2017). https:\/\/doi.org\/10.1016\/j.asoc.2017.01.039","journal-title":"Appl. Soft Comput."},{"key":"9_CR2","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.174","author":"JL Cano Rodr\u00edguez","year":"2015","unstructured":"Cano Rodr\u00edguez, J.L., et al.: poliastro: astrodynamics in Python. Zenodo (2015). https:\/\/doi.org\/10.5281\/zenodo.174","journal-title":"Zenodo"},{"key":"9_CR3","unstructured":"European Space Agency: Hera Mission. https:\/\/wwww.esa.int\/Safety_Security\/Hera\/Hera (2019). Accessed 22 Nov 2021"},{"key":"9_CR4","unstructured":"European Space Agency: Science & Exploration: Asteroids. https:\/\/www.esa.int\/Science_Exploration\/Human_and_Robotic_Exploration\/Exploration\/Asteroids (2021). Accessed 22 Nov 2021"},{"key":"9_CR5","unstructured":"Goldstein, H.: Classical Mechanics. Addison-Wesley (1980)"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Irurozki, E., L\u00f3pez-Ib\u00e1\u00f1ez, M.: Unbalanced mallows models for optimizing expensive black-box permutation problems. In: Proceedings of GECCO (2021). https:\/\/doi.org\/10.1145\/3449639.3459366","DOI":"10.1145\/3449639.3459366"},{"key":"9_CR7","unstructured":"Izzo, D.: Revisiting Lambert\u2019s problem. arXiv 1403.2705 [astro-ph.EP] (2014)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-01020-0_8","volume-title":"Evolutionary Multi-Criterion Optimization","author":"J Knowles","year":"2009","unstructured":"Knowles, J., Corne, D., Reynolds, A.: Noisy multiobjective optimization on a budget of 250 evaluations. In: Ehrgott, M., Fonseca, C.M., Gandibleux, X., Hao, J.-K., Sevaux, M. (eds.) EMO 2009. LNCS, vol. 5467, pp. 36\u201350. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01020-0_8"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"C\u00e1ceres, L.P., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Ant colony optimization on a limited budget of evaluations. Swarm Intell. 103\u2013124 (2015). https:\/\/doi.org\/10.1007\/s11721-015-0106-x","DOI":"10.1007\/s11721-015-0106-x"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Virtanen, P., et al.: SciPy 1.0: fundamental algorithms for scientific computing in Python. Nat. Meth. 17, 261\u2013272 (2020). https:\/\/doi.org\/10.1038\/s41592-019-0686-2","DOI":"10.1038\/s41592-019-0686-2"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Zaefferer, M., Stork, J., Friese, M., Fischbach, A., Naujoks, B., Bartz-Beielstein, T.: Efficient global optimization for combinatorial problems. In: Proceedings of GECCO, pp. 871\u2013878 (2014). https:\/\/doi.org\/10.1145\/2576768.2598282","DOI":"10.1145\/2576768.2598282"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-02462-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:06:18Z","timestamp":1710248778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-02462-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031024610","9783031024627"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-02462-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 April 2022","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":"Madrid","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2022\/","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":"67","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":"46","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":"69% - 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.1","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.56","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)"}}]}}