{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T09:16:04Z","timestamp":1778836564095,"version":"3.51.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030876715","type":"print"},{"value":"9783030876722","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-87672-2_31","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:02:46Z","timestamp":1632258166000},"page":"471-486","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Multi-objective Biased Random-Key Genetic Algorithm for Service Technician Routing and Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9979-7739","authenticated-orcid":false,"given":"Ricardo de Brito","family":"Damm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7647-2328","authenticated-orcid":false,"given":"D\u00e9bora P.","family":"Ronconi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"issue":"5","key":"31_CR1","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","volume":"15","author":"AA Kovacs","year":"2012","unstructured":"Kovacs, A.A., Parragh, S.N., Doerner, K.F., Hartl, R.F.: Adaptive large neighborhood search for service technician routing and scheduling problems. J. Sched. 15(5), 579\u2013600 (2012)","journal-title":"J. Sched."},{"issue":"5","key":"31_CR2","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1023\/A:1011377929184","volume":"7","author":"J Xu","year":"2001","unstructured":"Xu, J., Chiu, S.Y.: Effective heuristic procedures for a field technician scheduling problem. J. Heurist. 7(5), 495\u2013509 (2001)","journal-title":"J. Heurist."},{"issue":"7","key":"31_CR3","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1007\/s11590-012-0567-4","volume":"7","author":"V Pillac","year":"2012","unstructured":"Pillac, V., Gu\u00e9ret, C., Medaglia, A.L.: A parallel matheuristic for the technician routing and scheduling problem. Optim. Lett. 7(7), 1525\u20131535 (2012). https:\/\/doi.org\/10.1007\/s11590-012-0567-4","journal-title":"Optim. Lett."},{"issue":"3","key":"31_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0167-6377(96)00042-9","volume":"20","author":"E Tsang","year":"1997","unstructured":"Tsang, E., Voudouris, C.: Fast local search and guided local search and their application to British Telecom\u2019s workforce scheduling problem. Oper. Res. Lett. 20(3), 119\u2013127 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"31_CR5","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10951-010-0188-7","volume":"13","author":"JF Cordeau","year":"2010","unstructured":"Cordeau, J.F., Laporte, G., Pasin, F., Ropke, S.: Scheduling technicians and tasks in a telecommunications company. J. Sched. 13(4), 393\u2013409 (2010)","journal-title":"J. Sched."},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10479-009-0545-0","volume":"183","author":"H Hashimoto","year":"2011","unstructured":"Hashimoto, H., Boussier, S., Vasquez, M., Wilbaut, C.: A GRASP-based approach for technicians and interventions scheduling for telecommunications. Ann. Oper. Res. 183(1), 143\u2013161 (2011)","journal-title":"Ann. Oper. Res."},{"issue":"7","key":"31_CR7","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1007\/s11590-012-0557-6","volume":"7","author":"S Souyris","year":"2012","unstructured":"Souyris, S., Cort\u00e9s, C.E., Ord\u00f3\u00f1ez, F., Weintraub, A.: A robust optimization approach to dispatching technicians under stochastic service times. Optim. Lett. 7(7), 1549\u20131568 (2012). https:\/\/doi.org\/10.1007\/s11590-012-0557-6","journal-title":"Optim. Lett."},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1504\/EJIE.2016.076382","volume":"10","author":"C Fikar","year":"2016","unstructured":"Fikar, C., Juan, A.A., Martinez, E., Hirsch, P.: A discrete-event driven metaheuristic for dynamic home service routing with synchronised trip sharing. Eur. J. Ind. Eng. 10(3), 323\u2013340 (2016)","journal-title":"Eur. J. Ind. Eng."},{"issue":"5","key":"31_CR9","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.tre.2006.03.004","volume":"43","author":"H Tang","year":"2007","unstructured":"Tang, H., Miller-Hooks, E., Tomastik, R.: Scheduling technicians for planned maintenance of geographically distributed equipment. Transp. Res. Part E Logist. Transp. Rev. 43(5), 591\u2013609 (2007)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"issue":"4","key":"31_CR10","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1016\/j.omega.2008.05.003","volume":"37","author":"DL Overholts II","year":"2009","unstructured":"Overholts, D.L., II., Bell, J.E., Arostegui, M.A.: A location analysis approach for military maintenance scheduling with geographically dispersed service areas. Omega 37(4), 838\u2013852 (2009)","journal-title":"Omega"},{"issue":"1","key":"31_CR11","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.ejor.2014.03.006","volume":"238","author":"CE Cort\u00e9s","year":"2014","unstructured":"Cort\u00e9s, C.E., Gendreau, M., Rousseau, L.M., Souyris, S., Weintraub, A.: Branch-and-price and constraint programming for solving a real-life technician dispatching problem. Eur. J. Oper. Res. 238(1), 300\u2013312 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cor.2016.05.003","volume":"75","author":"RB Damm","year":"2016","unstructured":"Damm, R.B., Resende, M.G., Ronconi, D.P.: A biased random key genetic algorithm for the field technician scheduling problem. Comput. Oper. Res. 75, 49\u201363 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"31_CR13","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/j.cor.2007.12.011","volume":"36","author":"A Dohn","year":"2009","unstructured":"Dohn, A., Kolind, E., Clausen, J.: The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach. Comput. Oper. Res. 36(4), 1145\u20131157 (2009)","journal-title":"Comput. Oper. Res."},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.omega.2015.07.006","volume":"61","author":"X Chen","year":"2016","unstructured":"Chen, X., Thomas, B.W., Hewitt, M.: The technician routing problem with experience-based service times. Omega 61, 49\u201361 (2016)","journal-title":"Omega"},{"issue":"4","key":"31_CR15","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1080\/00207543.2014.955923","volume":"53","author":"Z Xu","year":"2015","unstructured":"Xu, Z., Ming, X.G., Zheng, M., Li, M., He, L., Song, W.: Cross-trained workers scheduling for field service using improved NSGA-II. Int. J. Prod. Res. 53(4), 1255\u20131272 (2015)","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1111\/itor.12429","volume":"24","author":"JS Brand\u00e3o","year":"2017","unstructured":"Brand\u00e3o, J.S., Noronha, T.F., Resende, M.G., Ribeiro, C.C.: A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems. Int. Trans. Oper. Res. 24(5), 1061\u20131077 (2017)","journal-title":"Int. Trans. Oper. Res."},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.asoc.2017.01.023","volume":"54","author":"RM de Oliveira","year":"2017","unstructured":"de Oliveira, R.M., Chaves, A.A., Lorena, L.A.N.: A comparison of two hybrid methods for constrained clustering problems. Appl. Soft Comput. 54, 256\u2013266 (2017)","journal-title":"Appl. Soft Comput."},{"key":"31_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.cie.2018.07.031","volume":"124","author":"AA Chaves","year":"2018","unstructured":"Chaves, A.A., Goncalves, J.F., Lorena, L.A.N.: Adaptive biased random-key genetic algorithm with local search for the capacitated centered clustering problem. Comput. Ind. Eng. 124, 331\u2013346 (2018)","journal-title":"Comput. Ind. Eng."},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Mauri, G.R., Biajoli, F.L., Rabello, R.L., Chaves, A.A., Ribeiro, G.M., Lorena, L.A.N.: Hybrid metaheuristics to solve a multiproduct two-stage capacitated facility location problem. Int. Trans. Oper. Res. (2021)","DOI":"10.1111\/itor.12930"},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.cor.2015.10.009","volume":"67","author":"AA Chaves","year":"2016","unstructured":"Chaves, A.A., Lorena, L.A.N., Senne, E.L.F., Resende, M.G.: Hybrid method with CS and BRKGA applied to the minimization of tool switches problem. Comput. Oper. Res. 67, 174\u2013183 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"31_CR21","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-010-9608-7","volume":"50","author":"TF Noronha","year":"2011","unstructured":"Noronha, T.F., Resende, M.G., Ribeiro, C.C.: A biased random-key genetic algorithm for routing and wavelength assignment. J. Glob. Optim. 50(3), 503\u2013518 (2011)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"31_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1111\/itor.12026","volume":"21","author":"LF Mor\u00e1n-Mirabal","year":"2014","unstructured":"Mor\u00e1n-Mirabal, L.F., Gonz\u00e1lez-Velarde, J.L., Resende, M.G.: Randomized heuristics for the family traveling salesperson problem. Int. Trans. Oper. Res. 21(1), 41\u201357 (2014)","journal-title":"Int. Trans. Oper. Res."},{"issue":"1\u20132","key":"31_CR23","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10479-015-1800-1","volume":"249","author":"F Stefanello","year":"2015","unstructured":"Stefanello, F., Buriol, L.S., Hirsch, M.J., Pardalos, P.M., Querido, T., Resende, M.G.C., Ritt, M.: On the minimization of traffic congestion in road networks with tolls. Ann. Oper. Res. 249(1\u20132), 119\u2013139 (2015). https:\/\/doi.org\/10.1007\/s10479-015-1800-1","journal-title":"Ann. Oper. Res."},{"key":"31_CR24","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-12631-9_9","volume-title":"Recent Advances in Computational Optimization","author":"P Tangpattanakul","year":"2015","unstructured":"Tangpattanakul, P., Jozefowiez, N., Lopez, P.: Biased random key genetic algorithm for\u00a0multi-user earth observation scheduling. In: Fidanova, S. (ed.) Recent Advances in Computational Optimization. SCI, vol. 580, pp. 143\u2013160. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-12631-9_9"},{"issue":"2","key":"31_CR25","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/j.ejor.2015.03.011","volume":"245","author":"P Tangpattanakul","year":"2015","unstructured":"Tangpattanakul, P., Jozefowiez, N., Lopez, P.: A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite. Eur. J. Oper. Res. 245(2), 542\u2013554 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"31_CR26","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"issue":"2","key":"31_CR27","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1590\/0101-7438.2014.034.02.0143","volume":"34","author":"JF Gon\u00e7alves","year":"2014","unstructured":"Gon\u00e7alves, J.F., Resende, M.G., Toso, R.F.: An experimental comparison of biased and unbiased random-key genetic algorithms. Pesquisa Operacional 34(2), 143\u2013164 (2014)","journal-title":"Pesquisa Operacional"},{"issue":"5","key":"31_CR28","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.: Biased random-key genetic algorithms for combinatorial optimization. J. Heurist. 17(5), 487\u2013525 (2011)","journal-title":"J. Heurist."},{"issue":"2","key":"31_CR29","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.A.M.T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"31_CR30","unstructured":"Goldberg, D. E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pp. 41\u201349. Lawrence Erlbaum, Hillsdale (1987)"},{"issue":"2","key":"31_CR31","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"2","key":"31_CR32","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-540-88908-3_14","volume-title":"Multiobjective Optimization","author":"E Zitzler","year":"2008","unstructured":"Zitzler, E., Knowles, J., Thiele, L.: Quality assessment of pareto set approximations. In: Branke, J., Deb, K., Miettinen, K., S\u0142owi\u0144ski, R. (eds.) Multiobjective Optimization. LNCS, vol. 5252, pp. 373\u2013404. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88908-3_14"},{"key":"31_CR34","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1002\/net.21876","volume":"73","author":"P Matl","year":"2019","unstructured":"Matl, P., Hartl, R.F., Vidal, T.: Leveraging single-objective heuristics to solve bi-objective problems: heuristic box splitting and its application to vehicle routing. Networks 73, 382\u2013400 (2019)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87672-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:10:48Z","timestamp":1632258648000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87672-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876715","9783030876722"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87672-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2021.nl\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"111","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":"42","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":"38% - 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":"2.5","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":"2","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)"}}]}}