{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:49:08Z","timestamp":1774910948091,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032205360","type":"print"},{"value":"9783032205377","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-20537-7_6","type":"book-chapter","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:29:35Z","timestamp":1773757775000},"page":"85-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Synergistic Adaptive Tabu Search: Multi-agent Learning with\u00a0Shared Solution Patterns for\u00a0the\u00a0K-Traveling Repairman Problem"],"prefix":"10.1007","author":[{"given":"Sirine","family":"Jmal","sequence":"first","affiliation":[]},{"given":"Boukthir","family":"Haddar","sequence":"additional","affiliation":[]},{"given":"Habib","family":"Chabchoub","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,18]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1051\/ita\/1986200100791","volume":"20","author":"F Afrati","year":"1986","unstructured":"Afrati, F., Cosmadakis, S., Papadimitriou, C.H., Papageorgiou, G., Papakostantinou, N.: The complexity of the travelling repairman problem. RAIRO - Theor. Inform. Appl. 20(1), 79\u201387 (1986). https:\/\/doi.org\/10.1051\/ita\/1986200100791","journal-title":"RAIRO - Theor. Inform. Appl."},{"key":"6_CR2","unstructured":"Augerat, P., Corberan, A., Benavent, E., Belenguer, J.: Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report, RR 949-M, Universit\u00e9 Grenoble 1, France (1995)"},{"key":"6_CR3","unstructured":"Birkenes, V.\u00d8.: A deep reinforcement learning-based hyperheuristic for the flexible traveling repairman problem with drones. Master\u2019s thesis, The University of Bergen (2023)"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. Oper. Res. Q. 20(3), 309\u2013318 (1969)","journal-title":"Oper. Res. Q."},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Delamer, J.-A., Givigi, S.: A system based on deep-learning for dynamic routing problems. In: 2022 IEEE International Systems Conference (SysCon), pp. 1\u20137 (2022). https:\/\/doi.org\/10.1109\/SysCon53536.2022.9773930","DOI":"10.1109\/SysCon53536.2022.9773930"},{"issue":"5","key":"6_CR6","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1504\/IJMOR.2012.048928","volume":"4","author":"IO Ezzine","year":"2012","unstructured":"Ezzine, I.O., Elloumi, S.: Polynomial formulation and heuristic based approach for the k-travelling repairman problem. Int. J. Math. Oper. Res. 4(5), 503\u2013514 (2012). https:\/\/doi.org\/10.1504\/IJMOR.2012.048928","journal-title":"Int. J. Math. Oper. Res."},{"issue":"6","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1287\/opre.41.6.1055","volume":"41","author":"M Fischetti","year":"1993","unstructured":"Fischetti, M., Laporte, G., Martello, S.: The delivery man problem and cumulative matroids. Oper. Res. 41(6), 1055\u20131064 (1993). https:\/\/doi.org\/10.1287\/opre.41.6.1055","journal-title":"Oper. Res."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Hmayer, A., Ezzine, I.O.: Clarans heuristic based approach for the k-traveling repairman problem. In: Proceedings of the International Conference on Advanced Logistics and Transport, pp. 535\u2013538 (2013)","DOI":"10.1109\/ICAdLT.2013.6568515"},{"issue":"23","key":"6_CR9","doi-asserted-by":"publisher","first-page":"12547","DOI":"10.1007\/s00500-019-03805-x","volume":"23","author":"S Jmal","year":"2019","unstructured":"Jmal, S., Haddar, B., Chabchoub, H.: Apply the quantum particle swarm optimization for the K-traveling repairman problem. Soft. Comput. 23(23), 12547\u201312560 (2019). https:\/\/doi.org\/10.1007\/s00500-019-03805-x","journal-title":"Soft. Comput."},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Kara, I., Kara, B.Y., Yetis, M.K.: Cumulative vehicle routing problems. Vehicle Routing Problem, pp. 85\u201398. I-Tech Education and Publishing KG Vienna, Austria (2008). https:\/\/doi.org\/10.5772\/5812","DOI":"10.5772\/5812"},{"key":"6_CR11","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: Proceedings of the International Conference on Learning Representations (ICLR) (2019)"},{"issue":"8","key":"6_CR12","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics-Doklady 10(8), 707\u2013710 (1966)","journal-title":"Soviet Physics-Doklady"},{"issue":"7540","key":"6_CR13","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., Kavukcuoglu, K., Silver, D., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529\u2013533 (2015). https:\/\/doi.org\/10.1038\/nature14236","journal-title":"Nature"},{"key":"6_CR14","unstructured":"Nazari, M., et al.: Reinforcement learning for solving the vehicle routing problem. In: Advances in Neural Information Processing Systems, pp. 9839\u20139849 (2018)"},{"issue":"11","key":"6_CR15","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu, S.U., Prins, C., Calvo, R.W.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37(11), 1877\u20131885 (2010). https:\/\/doi.org\/10.1016\/j.cor.2009.06.014","journal-title":"Comput. Oper. Res."},{"key":"6_CR16","unstructured":"Onder, E., Gundogdu, N.K., Yucel, H.B.: A new mathematical model for the k-traveling repairman problem. In: 2015 Industrial and Systems Engineering Research Conference (ISERC) (2015)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.trpro.2017.03.042","volume":"22","author":"G Onder","year":"2017","unstructured":"Onder, G., Kara, I., Derya, T.: New integer programming formulation for multiple traveling repairmen problem. Transp. Res. Procedia 22, 355\u2013361 (2017). https:\/\/doi.org\/10.1016\/j.trpro.2017.03.042","journal-title":"Transp. Res. Procedia"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 5th edn. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-031-05921-6","DOI":"10.1007\/978-3-031-05921-6"},{"issue":"23","key":"6_CR19","doi-asserted-by":"publisher","first-page":"9253","DOI":"10.1016\/j.eswa.2015.07.070","volume":"42","author":"I Sghir","year":"2015","unstructured":"Sghir, I., Hao, J.-K., Jaafar, I.B., Gh\u00e9dira, K.: A multi-agent based optimization method applied to the quadratic assignment problem. Expert Syst. Appl. 42(23), 9253\u20139262 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J-F Cordeau","year":"1997","unstructured":"Cordeau, J.-F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing. Networks 30(2), 105\u2013119 (1997)","journal-title":"Networks"},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23(3), 555\u2013565 (1976). https:\/\/doi.org\/10.1145\/321958.321975","journal-title":"J. ACM"},{"issue":"3","key":"6_CR22","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/07408179108963858","volume":"23","author":"D Simchi-Levi","year":"1991","unstructured":"Simchi-Levi, D., Berman, O.: Minimizing the total flow time of n jobs on a network. IIE Trans. 23(3), 236\u2013244 (1991). https:\/\/doi.org\/10.1080\/07408179108963858","journal-title":"IIE Trans."},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-24873-3_20","volume-title":"Algorithmic Decision Theory","author":"T Tulabandhula","year":"2011","unstructured":"Tulabandhula, T., Rudin, C., Jaillet, P.: The machine learning and traveling repairman problem. In: Brafman, R.I., Roberts, F.S., Tsouki\u00e0s, A. (eds.) ADT 2011. LNCS (LNAI), vol. 6992, pp. 262\u2013276. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24873-3_20"},{"issue":"2","key":"6_CR24","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10479-015-1792-x","volume":"242","author":"B Yao","year":"2015","unstructured":"Yao, B., Yu, B., Hu, P., Gao, J., Zhang, M.: An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Ann. Oper. Res. 242(2), 303\u2013320 (2015). https:\/\/doi.org\/10.1007\/s10479-015-1792-x","journal-title":"Ann. Oper. Res."},{"key":"6_CR25","unstructured":"Yuan, L., et al.: A survey of progress on cooperative multi-agent reinforcement learning in open environment. arXiv preprint arXiv:2312.01058 (2023)"},{"key":"6_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106758","volume":"170","author":"Y Zou","year":"2024","unstructured":"Zou, Y., Hao, J.-K., Wu, Q.: A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem. Comput. Oper. Res. 170, 106758 (2024). https:\/\/doi.org\/10.1016\/j.cor.2024.106758","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-20537-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:02:58Z","timestamp":1774908178000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20537-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032205360","9783032205377"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20537-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"18 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}