{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T05:52:43Z","timestamp":1750830763519,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"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_18","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"250-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing High-Quality Solutions for\u00a0the\u00a0Patient Admission Scheduling Problem Using Evolutionary Diversity Optimisation"],"prefix":"10.1007","author":[{"given":"Adel","family":"Nikfarjam","sequence":"first","affiliation":[]},{"given":"Amirhossein","family":"Moosavi","sequence":"additional","affiliation":[]},{"given":"Aneta","family":"Neumann","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Alexander, B., Kortman, J., Neumann, A.: Evolution of artistic image variants through feature based diversity optimisation. In: GECCO, pp. 171\u2013178. ACM (2017)","DOI":"10.1145\/3071178.3071342"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.ejor.2018.09.003","volume":"273","author":"LS Bastos","year":"2019","unstructured":"Bastos, L.S., Marchesi, J.F., Hamacher, S., Fleck, J.L.: A mixed integer programming approach to the patient admission scheduling problem. Eur. J. Oper. Res. 273(3), 831\u2013840 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bossek, J., Neumann, A., Neumann, F.: Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. In: GECCO, pp. 556\u2013564. ACM (2021)","DOI":"10.1145\/3449639.3459364"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bossek, J., Neumann, F.: Evolutionary diversity optimization and the minimum spanning tree problem. In: GECCO, pp. 198\u2013206. ACM (2021)","DOI":"10.1145\/3449639.3459363"},{"issue":"10","key":"18_CR5","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1016\/j.cor.2011.01.007","volume":"38","author":"S Ceschia","year":"2011","unstructured":"Ceschia, S., Schaerf, A.: Local search and lower bounds for the patient admission scheduling problem. Comput. Oper. Res. 38(10), 1452\u20131463 (2011)","journal-title":"Comput. Oper. Res."},{"key":"18_CR6","unstructured":"Demeester, P.: Patient admission scheduling (2021). https:\/\/people.cs.kuleuven.be\/~tony.wauters\/wim.vancroonenburg\/pas\/"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.artmed.2009.09.001","volume":"48","author":"P Demeester","year":"2010","unstructured":"Demeester, P., Souffriau, W., De Causmaecker, P., Berghe, G.V.: A hybrid Tabu search algorithm for automatically assigning patients to beds. Artif. Intell. Med. 48(1), 61\u201370 (2010)","journal-title":"Artif. Intell. Med."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Do, A.V., Bossek, J., Neumann, A., Neumann, F.: Evolving diverse sets of tours for the travelling salesperson problem. In: GECCO, pp. 681\u2013689. ACM (2020)","DOI":"10.1145\/3377930.3389844"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Do, A.V., Guo, M., Neumann, A., Neumann, F.: Analysis of evolutionary diversity optimisation for permutation problems. In: GECCO, pp. 574\u2013582. ACM (2021)","DOI":"10.1145\/3449639.3459313"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: Optimal parameter choices through self-adjustment: applying the 1\/5-th rule in discrete settings. In: GECCO Companion, pp. 1335\u20131342 (2015)","DOI":"10.1145\/2739480.2754684"},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10479-016-2172-x","volume":"258","author":"G Dur\u00e1n","year":"2016","unstructured":"Dur\u00e1n, G., Rey, P.A., Wolff, P.: Solving the operating room scheduling problem with prioritized lists of patients. Ann. Oper. Res. 258(2), 395\u2013414 (2016). https:\/\/doi.org\/10.1007\/s10479-016-2172-x","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.3934\/jimo.2019030","volume":"16","author":"B Erfani","year":"2020","unstructured":"Erfani, B., Ebrahimnejad, S., Moosavi, A.: An integrated dynamic facility layout and job shop scheduling problem: a hybrid NSGA-II and local search algorithm. J. Ind. Manag. Optim. 16(4), 1801 (2020)","journal-title":"J. Ind. Manag. Optim."},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1162\/evco_a_00274","volume":"29","author":"W Gao","year":"2021","unstructured":"Gao, W., Nallaperuma, S., Neumann, F.: Feature-based diversity optimization for problem instance classification. Evol. Comput. 29(1), 107\u2013128 (2021)","journal-title":"Evol. Comput."},{"key":"18_CR14","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1nez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1nez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Neumann, A., Antipov, D., Neumann, F.: Coevolutionary Pareto diversity optimization. CoRR arXiv:2204.05457 (2022), accepted as full paper at GECCO 2022","DOI":"10.1145\/3512290.3528755"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Neumann, A., Bossek, J., Neumann, F.: Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. In: GECCO, pp. 261\u2013269. ACM (2021)","DOI":"10.1145\/3449639.3459385"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Neumann, A., Gao, W., Doerr, C., Neumann, F., Wagner, M.: Discrepancy-based evolutionary diversity optimization. In: GECCO, pp. 991\u2013998. ACM (2018)","DOI":"10.1145\/3205455.3205532"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Neumann, A., Gao, W., Wagner, M., Neumann, F.: Evolutionary diversity optimization using multi-objective indicators. In: GECCO, pp. 837\u2013845. ACM (2019)","DOI":"10.1145\/3321707.3321796"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Neumann, A., Szpak, Z.L., Chojnacki, W., Neumann, F.: Evolutionary image composition using feature covariance matrices. In: GECCO, pp. 817\u2013824 (2017)","DOI":"10.1145\/3071178.3071260"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Bossek, J., Neumann, A., Neumann, F.: Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. In: FOGA, pp. 9:1\u20139:11. ACM (2021)","DOI":"10.1145\/3450218.3477310"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Bossek, J., Neumann, A., Neumann, F.: Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. In: GECCO, pp. 600\u2013608. ACM (2021)","DOI":"10.1145\/3449639.3459384"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Moosavi, A.: An integrated (1, t) inventory policy and vehicle routing problem under uncertainty: an accelerated benders decomposition algorithm. Transp. Lett. 1\u201322 (2020)","DOI":"10.1080\/19427867.2020.1714843"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Nikfarjam, A., Neumann, A., Neumann, F.: Evolutionary diversity optimisation for the traveling thief problem. CoRR abs\/2204.02709 (2022), accepted as full paper at GECCO 2022","DOI":"10.1145\/3512290.3528862"},{"issue":"1","key":"18_CR24","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.ejor.2013.10.050","volume":"235","author":"TM Range","year":"2014","unstructured":"Range, T.M., Lusby, R.M., Larsen, J.: A column generation approach for solving the patient admission scheduling problem. Eur. J. Oper. Res. 235(1), 252\u2013264 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.cor.2016.11.016","volume":"80","author":"AM Turhan","year":"2017","unstructured":"Turhan, A.M., Bilgen, B.: Mixed integer programming based heuristics for the patient admission scheduling problem. Comput. Oper. Res. 80, 38\u201349 (2017)","journal-title":"Comput. Oper. Res."},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Ulrich, T., Thiele, L.: Maximizing population diversity in single-objective optimization. In: GECCO, pp. 641\u2013648. ACM (2011)","DOI":"10.1145\/2001576.2001665"},{"key":"18_CR27","unstructured":"World Health Organization: Global spending on health: weathering the storm (2022). https:\/\/www.who.int\/publications\/i\/item\/9789240017788"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Yuan, B., Gallagher, M.: A hybrid approach to parameter tuning in genetic algorithms. In: 2005 IEEE Congress on Evolutionary Computation, vol. 2, pp. 1096\u20131103. IEEE (2005)","DOI":"10.1109\/CEC.2005.1554813"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T17:48:47Z","timestamp":1727804927000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_18","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)"}}]}}