{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T17:25:09Z","timestamp":1780593909039,"version":"3.54.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031271809","type":"print"},{"value":"9783031271816","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-27181-6_28","type":"book-chapter","created":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T04:34:21Z","timestamp":1678422861000},"page":"402-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Simulated Annealing for\u00a0the\u00a0Home Healthcare Routing and\u00a0Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1191-1929","authenticated-orcid":false,"given":"Sara","family":"Ceschia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0299-6086","authenticated-orcid":false,"given":"Luca","family":"Di Gaspero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6965-0536","authenticated-orcid":false,"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,11]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Begur, S.V., Miller, D.M., Weaver, J.R.: An integrated spatial DSS for scheduling and routing home-health-care nurses. Interfaces 27 (1997)","DOI":"10.1287\/inte.27.4.35"},{"key":"28_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105300","volume":"132","author":"R Bellio","year":"2021","unstructured":"Bellio, R., Ceschia, S., Di Gaspero, L., Schaerf, A.: Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling. Comput. Oper. Res. 132, 105300 (2021)","journal-title":"Comput. Oper. Res."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Bertels, S., Fahle, T.: A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Comput. Oper. Res. 33 (2006)","DOI":"10.1016\/j.cor.2005.01.015"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-02538-9_13","volume-title":"Experimental Methods for the Analysis of Optimization Algorithms","author":"M Birattari","year":"2010","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., St\u00fctzle, T.: F-Race and iterated F-Race: an overview. In: Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, pp. 311\u2013336. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-02538-9_13"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ejor.2007.07.033","volume":"191","author":"D Bredstr\u00f6m","year":"2008","unstructured":"Bredstr\u00f6m, D., R\u00f6nnqvist, M.: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur. J. Oper. Res. 191(1), 19\u201331 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Ceschia, S., Di Gaspero, L., Rosati, R.M., Schaerf, A.: Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem. EURO J. Comput. Optim. 1\u201332 (2021)","DOI":"10.1016\/j.ejco.2021.100024"},{"key":"28_CR7","unstructured":"Cheng, E., Rich, J.: A home health care routing and scheduling problem. Technical report. CAAM TR98-04, Rice University (1998)"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.orhc.2018.01.004","volume":"16","author":"J Decerle","year":"2018","unstructured":"Decerle, J., Grunder, O., El Hassani, A.H., Barakat, O.: A memetic algorithm for a home health care routing and scheduling problem. Oper. Res. Health Care 16, 59\u201371 (2018)","journal-title":"Oper. Res. Health Care"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-07644-7_1","volume-title":"Hybrid Metaheuristics","author":"L Di Gaspero","year":"2014","unstructured":"Di Gaspero, L., Urli, T.: A CP\/LNS approach for multi-day homecare scheduling problems. In: Blesa, M.J., Blum, C., Vo\u00df, S. (eds.) HM 2014. LNCS, vol. 8457, pp. 1\u201315. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07644-7_1"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Eveborn, P., Flisberg, P., R\u00f6nnqvist, M.: Laps care\u2013an operational system for staff planning of home care. Eur. J. Oper. Res. 171 (2006)","DOI":"10.1016\/j.ejor.2005.01.011"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.cor.2016.07.019","volume":"77","author":"C Fikar","year":"2017","unstructured":"Fikar, C., Hirsch, P.: Home health care routing and scheduling: a review. Comput. Oper. Res. 77, 86\u201395 (2017)","journal-title":"Comput. Oper. Res."},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.cor.2018.12.015","volume":"104","author":"A Franzin","year":"2019","unstructured":"Franzin, A., St\u00fctzle, T.: Revisiting simulated annealing: a component-based analysis. Comput. Oper. Res. 104, 191\u2013206 (2019)","journal-title":"Comput. Oper. Res."},{"key":"28_CR13","unstructured":"Genet, N., Boerma, W., Kroneman, M., Hutchinson, A., Saltman, R.B. (eds.): Homecare Across Europe. World Health Organization. European Observatory on Health Systems and Policies (2012)"},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.ejor.2018.11.025","volume":"275","author":"F Grenouilleau","year":"2019","unstructured":"Grenouilleau, F., Legrain, A., Lahrichi, N., Rousseau, L.M.: A set partitioning heuristic for the home health care routing and scheduling problem. Eur. J. Oper. Res. 275(1), 295\u2013303 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-5819-7","volume-title":"Monte Carlo Methods","author":"JM Hammersley","year":"1964","unstructured":"Hammersley, J.M., Handscomb, D.C.: Monte Carlo Methods. Chapman and Hall, London (1964)"},{"key":"28_CR16","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, D., Vecchi, M.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"28_CR17","unstructured":"Kummer, A.F.: A study on the home care routing and scheduling problem. Ph.D. thesis, Universidade Federal do Rio Grande do Sul (2021)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Kummer, A.F., de Ara\u00fajo, O.C.B., Buriol, L.S., Resende, M.G.C.: A biased random-key genetic algorithm for the home health care problem (2022). arXiv preprint arXiv:2206.14347","DOI":"10.1111\/itor.13221"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Kummer, A.F., Buriol, L.S., de Ara\u00fajo, O.C.: A biased random key genetic algorithm applied to the VRPTW with skill requirements and synchronization constraints. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pp. 717\u2013724 (2020)","DOI":"10.1145\/3377930.3390209"},{"key":"28_CR20","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-95104-1_16","volume-title":"Bioinspired Heuristics for Optimization","author":"S Lasfargeas","year":"2019","unstructured":"Lasfargeas, S., Gagn\u00e9, C., Sioud, A.: Solving the home health care problem with temporal precedence and synchronization. In: Talbi, E.-G., Nakib, A. (eds.) Bioinspired Heuristics for Optimization. SCI, vol. 774, pp. 251\u2013267. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-95104-1_16"},{"issue":"1","key":"28_CR21","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10729-013-9243-1","volume":"17","author":"DS Mankowska","year":"2014","unstructured":"Mankowska, D.S., Meisel, F., Bierwirth, C.: The home health care routing and scheduling problem with interdependent services. Health Care Manag. Sci. 17(1), 15\u201330 (2014)","journal-title":"Health Care Manag. Sci."},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Rasmussen, M.S., Justesen, T., Dohn, A., Larsen, J.: The home care crew scheduling problem: preference-based visit clustering and temporal dependencies. Eur. J. Oper. Res. 219 (2012)","DOI":"10.1016\/j.ejor.2011.10.048"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-29828-8_22","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"A Rendl","year":"2012","unstructured":"Rendl, A., Prandtstetter, M., Hiermann, G., Puchinger, J., Raidl, G.: Hybrid heuristics for multimodal homecare scheduling. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 339\u2013355. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29828-8_22"},{"key":"28_CR24","unstructured":"Urli, T.: json2run: a tool for experiment design & analysis. CoRR abs\/1305.1112 (2013)"},{"key":"28_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1111\/itor.13043","volume":"30","author":"T Xiang","year":"2021","unstructured":"Xiang, T., Li, Y., Szeto, W.Y.: The daily routing and scheduling problem of home health care: based on costs and participants\u2019 preference satisfaction. Int. Trans. Oper. Res. 30, 39\u201369 (2021)","journal-title":"Int. Trans. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","AIxIA 2022 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27181-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T04:38:07Z","timestamp":1678423087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27181-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031271809","9783031271816"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27181-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Udine","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"28 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2022.uniud.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","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":"33","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":"61% - 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","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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This proceeding includes one invited paper.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}