{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T08:08:59Z","timestamp":1763194139612,"version":"3.45.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032079978","type":"print"},{"value":"9783032079985","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-07998-5_1","type":"book-chapter","created":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T08:04:18Z","timestamp":1763193858000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["GRASP-Based Memetic Algorithm for\u00a0Multi-period Technician Routing Problem with\u00a0Mandatory Assigned Tasks and\u00a0Selective Tasks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-3294-1732","authenticated-orcid":false,"given":"Lo\u00efc","family":"Cardina\u00ebl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2822-0262","authenticated-orcid":false,"given":"W. Ramdane","family":"Cherif-Khettaf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2357-0404","authenticated-orcid":false,"given":"Ammar","family":"Oulamara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,16]]},"reference":[{"issue":"4\u20135","key":"1_CR1","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.dam.2011.12.021","volume":"161","author":"C Archetti","year":"2013","unstructured":"Archetti, C., Bianchessi, N., Speranza, M.G.: Optimal solutions for routing problems with profits. Discret. Appl. Math. 161(4\u20135), 547\u2013557 (2013)","journal-title":"Discret. Appl. Math."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.cor.2015.03.014","volume":"61","author":"C Archetti","year":"2015","unstructured":"Archetti, C., Jabali, O., Speranza, M.G.: Multi-period vehicle routing problem with due dates. Comput. Oper. Res. 61, 122\u2013134 (2015)","journal-title":"Comput. Oper. Res."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-013-1366-8","volume":"206","author":"T Athanasopoulos","year":"2013","unstructured":"Athanasopoulos, T., Minis, I.: Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework. Ann. Oper. Res. 206, 1\u201322 (2013)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part i: route construction and local search algorithms. Transp. Sci. 39(1), 104\u2013118 (2005)","journal-title":"Transp. Sci."},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.ejor.2017.08.027","volume":"265","author":"T Bulh\u00f5es","year":"2018","unstructured":"Bulh\u00f5es, T., Ha, M.H., Martinelli, R., Vidal, T.: The vehicle routing problem with service level constraints. Eur. J. Oper. Res. 265(2), 544\u2013558 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Cardinael, L., Ramdane Cherif-Khettaf, W., Oulamara, A.: Memetic algorithms for the workforce routing and scheduling problem: case study of energy distribution system operator (DSO). In: 9th International Conference on Metaheuristics and Nature Inspired Computing META 2023. Marrakech (MA), Morocco (2023). https:\/\/hal.science\/hal-04521142","DOI":"10.1007\/978-3-031-69257-4_17"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.: Greedy randomized adaptive search procedures. J. Global Optim. 6, 109\u2013133 (1995)","journal-title":"J. Global Optim."},{"key":"1_CR8","unstructured":"Festa, P., et\u00a0al.: Effective application of grasp. In: Cochran J.J., Cox Jr. L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science, vol. 3, pp. 1609\u20131617. John Wiley & Sons (2011)"},{"key":"1_CR9","unstructured":"G. B. H. M. Maroto, S.D.L.R.: Hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res., 575\u2013592 (2008)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"102302","DOI":"10.1016\/j.omega.2020.102302","volume":"102","author":"G Guastaroba","year":"2021","unstructured":"Guastaroba, G., C\u00f4t\u00e9, J.F., Coelho, L.C.: The multi-period workforce scheduling and routing problem. Omega 102, 102302 (2021)","journal-title":"Omega"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Kaabi, H., Jabeur, K.: Hybrid algorithm for solving the multi-compartment vehicle routing problem with time windows and profit. In: 2015 12th International Conference on Informatics in Control, Automation and Robotics (ICINCO), vol.\u00a01, pp. 324\u2013329. IEEE (2015)","DOI":"10.5220\/0005572503240329"},{"issue":"10","key":"1_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.4186\/ej.2021.25.10.71","volume":"25","author":"K Kamsopa","year":"2021","unstructured":"Kamsopa, K., Sethanan, K., Jamrus, T., Czwajda, L.: Hybrid genetic algorithm for multi-period vehicle routing problem with mixed pickup and delivery with time window, heterogeneous fleet, duration time and rest area. Eng. J. 25(10), 71\u201386 (2021)","journal-title":"Eng. J."},{"key":"1_CR13","unstructured":"Karademir, S.: A genetic algorithm for the biobjective traveling salesman problem with profits. Master\u2019s thesis, Middle East Technical University (2008)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Khalfay, A., Crispin, A., Crockett, K.: A review of technician and task scheduling problems, datasets and solution approaches. In: 2017 Intelligent Systems Conference (IntelliSys), pp. 288\u2013296. IEEE (2017)","DOI":"10.1109\/IntelliSys.2017.8324306"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Khattara, A., Ramdane Cherif-Khettaf, W., Mostefai, M.: An efficient metaheuristic approach for the multi-period technician routing and scheduling problem. Eng., Technol. Appl. Sci. Res. 9(5) (2019)","DOI":"10.48084\/etasr.3091"},{"key":"1_CR16","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, 579\u2013600 (2012)","journal-title":"J. Sched."},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/J.EJOR.2015.12.032","volume":"252","author":"Y Li","year":"2016","unstructured":"Li, Y., Chen, H., Prins, C.: Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur. J. Oper. Res. 252(1), 27\u201338 (2016). https:\/\/doi.org\/10.1016\/J.EJOR.2015.12.032","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"1_CR18","doi-asserted-by":"publisher","first-page":"3943","DOI":"10.3390\/app10113943","volume":"10","author":"S Nucamendi-Guill\u00e9n","year":"2020","unstructured":"Nucamendi-Guill\u00e9n, S., Flores-D\u00edaz, D., Olivares-Benitez, E., Mendoza, A.: A memetic algorithm for the cumulative capacitated vehicle routing problem including priority indexes. Appl. Sci. 10(11), 3943 (2020)","journal-title":"Appl. Sci."},{"issue":"24","key":"1_CR19","doi-asserted-by":"publisher","first-page":"19007","DOI":"10.1007\/s00500-020-05333-5","volume":"24","author":"E Pekel","year":"2020","unstructured":"Pekel, E.: Solving technician routing and scheduling problem using improved particle swarm optimization. Soft. Comput. 24(24), 19007\u201319015 (2020). https:\/\/doi.org\/10.1007\/s00500-020-05333-5","journal-title":"Soft. Comput."},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Pekel, E.: A simple solution to technician routing and scheduling problem using improved genetic algorithm. Soft. Comput. (24), 1\u201310 (2022). https:\/\/doi.org\/10.1007\/s00500-022-07072-1","DOI":"10.1007\/s00500-022-07072-1"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez, A.L., Lujak, M., Semet, F., Billhardt, H.: Vehicle routing problem with fair profits and time windows (VRP-FPTW). In: 2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 1530\u20131536. IEEE (2023)","DOI":"10.1109\/SMC53992.2023.10394012"},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1287\/trsc.2015.0584","volume":"50","author":"T Vidal","year":"2016","unstructured":"Vidal, T., Maculan, N., Ochi, L.S., Vaz Penna, P.H.: Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transp. Sci. 50(2), 720\u2013734 (2016)","journal-title":"Transp. Sci."},{"key":"1_CR23","unstructured":"Villegas, J., Gu\u00e9ret, C., Mendoza, J.E., Montoya, A.: The technician routing and scheduling problem with conventional and electric vehicle (2018). https:\/\/hal.science\/hal-01813887. working paper or preprint"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Widyandaru, R.B., Arvitrida, N.I., Rusdiansyah, A.: Integrated location and technician routing problem with profits and time windows for supporting maintenance activities of technology infrastructure. In: International Conference on Industrial Engineering and Operations Management Nsukka (2022)","DOI":"10.46254\/AF03.20220211"},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2016.06.058","volume":"257","author":"E Zamorano","year":"2017","unstructured":"Zamorano, E., Stolletz, R.: Branch-and-price approaches for the multiperiod technician routing and scheduling problem. Eur. J. Oper. Res. 257(1), 55\u201368 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1_CR26","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.ejor.2012.11.059","volume":"229","author":"Z Zhang","year":"2013","unstructured":"Zhang, Z., Che, O., Cheang, B., Lim, A., Qin, H.: A memetic algorithm for the multiperiod vehicle routing problem with profit. Eur. J. Oper. Res. 229(3), 573\u2013584 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR27","unstructured":"Zmazek, B.: Multiple trips within working day in capacitated VRP with time windows. In: WSEAS Intl. Conf. on Computers, pp. 93\u201399 (2006)"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07998-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T08:04:19Z","timestamp":1763193859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07998-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,16]]},"ISBN":["9783032079978","9783032079985"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07998-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,16]]},"assertion":[{"value":"16 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Evolution (Evolution Artificielle)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ae2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ea2024.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}