{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:54:39Z","timestamp":1742950479957,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030166915"},{"type":"electronic","value":"9783030166922"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16692-2_4","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T19:44:24Z","timestamp":1554839064000},"page":"49-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantifying the Effects of Increasing User Choice in MAP-Elites Applied to a Workforce Scheduling and Routing Problem"],"prefix":"10.1007","author":[{"given":"Neil","family":"Urquhart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emma","family":"Hart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Hutcheson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,30]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.3389\/frobt.2016.00040","volume":"3","author":"JK Pugh","year":"2016","unstructured":"Pugh, J.K., Soros, L.B., Stanley, K.O.: Quality diversity: a new frontier for evolutionary computation. Front. Robot. AI 3, 40 (2016)","journal-title":"Front. Robot. AI"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-319-99253-2_39","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"N Urquhart","year":"2018","unstructured":"Urquhart, N., Hart, E.: Optimisation and illumination of a real-world workforce scheduling and routing application (WSRP) via Map-Elites. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 488\u2013499. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-99253-2_39"},{"key":"4_CR3","unstructured":"Castillo-Salazar, J.A., Landa-Silva, D., Qu, R.: A survey on workforce scheduling and routing problems. In: Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling, pp. 283\u2013302 (2012)"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10479-014-1687-2","volume":"239","author":"JA Castillo-Salazar","year":"2016","unstructured":"Castillo-Salazar, J.A., Landa-Silva, D., Qu, R.: Workforce scheduling and routing problems: literature survey and computational study. Ann. Oper. Res. 239(1), 39\u201367 (2016). \n                      https:\/\/doi.org\/10.1007\/s10479-014-1687-2","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.ejor.2015.07.028","volume":"248","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Hartl, R.F., Parragh, S.N., Tricoire, F.: A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience. Eur. J. Oper. Res. 248(2), 428\u2013443 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10100-013-0305-8","volume":"23","author":"G Hiermann","year":"2015","unstructured":"Hiermann, G., Prandtstetter, M., Rendl, A., Puchinger, J., Raidl, G.R.: Metaheuristics for solving a multimodal home-healthcare scheduling problem. Cent. Eur. J. Oper. Res. 23(1), 89\u2013113 (2015). \n                      https:\/\/doi.org\/10.1007\/s10100-013-0305-8","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"4_CR7","unstructured":"Rasmussen, M., Justesen, T., Dohn, A., Larsen, J.: The home care crew scheduling problem: preference-based visit clustering and temporal dependencies. DTU Management (2010)"},{"key":"4_CR8","unstructured":"Misir, M., Smet, P., Verbeeck, K., Berghe, G.V.: Security personnel routing and rostering: a hyper-heuristic approach. In: Proceedings of the 3rd International Conference on Applied Operational Research, ICAOR11 (2011)"},{"key":"4_CR9","unstructured":"G\u00fcnther, M., Nissen, V.: Application of particle swarm optimization to the British telecom workforce scheduling problem. In: Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), Son, Norway (2012)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Lehman, J., Stanley, K.O.: Evolving a diversity of virtual creatures through novelty search and local competition. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, pp. 211\u2013218. ACM (2011)","DOI":"10.1145\/2001576.2001606"},{"key":"4_CR11","unstructured":"Mouret, J., Clune, J.: Illuminating search spaces by mapping elites. CoRR (2015)"},{"key":"4_CR12","unstructured":"Vassiliades, V., Chatzilygeroudis, K., Mouret, J.B.: Using centroidal voronoi tessellations to scale up the multi-dimensional archive of phenotypic elites algorithm, pp. 1\u20131 (2017)"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1162\/evco_a_00231","volume":"26","author":"A Gaier","year":"2018","unstructured":"Gaier, A., Asteroth, A., Mouret, J.B.: Data-efficient design exploration through surrogate-assisted illumination. Evol. Comput. 26(3), 381\u2013410 (2018)","journal-title":"Evol. Comput."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-319-99253-2_40","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"A Hagg","year":"2018","unstructured":"Hagg, A., Asteroth, A., B\u00e4ck, T.: Prototype discovery using quality-diversity. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 500\u2013511. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-99253-2_40"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Urquhart, N.B., Hart, E., Judson, A.: Multi-modal employee routing with time windows in an urban environment. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1503\u20131504. ACM (2015)","DOI":"10.1145\/2739482.2764649"},{"key":"4_CR16","unstructured":"TFL: Travel in London: key trends and developments. Techical report, Transport for London (2009)"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Urquhart, N.B., Hart, E., Judson, A.: Multi-modal employee routing with time windows in an urban environment. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1503\u20131504. GECCO Companion 2015. ACM, New York (2015). \n                      https:\/\/doi.org\/10.1145\/2739482.2764649","DOI":"10.1145\/2739482.2764649"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16692-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:03:07Z","timestamp":1558342987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16692-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030166915","9783030166922"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16692-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 March 2019","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":"Leipzig","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2019\/cfp_evoapps.php","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"}},{"value":"MyReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"67% - 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"}},{"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"}},{"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"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}