{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:40Z","timestamp":1759847260109,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11590-020-01551-w","type":"journal-article","created":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T16:03:08Z","timestamp":1582128188000},"page":"2285-2299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Variable neighborhood search based algorithms to solve a rich k-travelling repairmen problem"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6938-8216","authenticated-orcid":false,"given":"Sana","family":"Frifita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ines","family":"Mathlouthi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malek","family":"Masmoudi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelaziz","family":"Dammak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,19]]},"reference":[{"key":"1551_CR1","doi-asserted-by":"publisher","first-page":"5997","DOI":"10.1016\/j.eswa.2013.05.036","volume":"40","author":"N Bjeli\u0107","year":"2013","unstructured":"Bjeli\u0107, N., Vidovi\u0107, M., Popovi\u0107, D.: Variable neighborhood search algorithm for heterogeneous traveling repairmen problem with time windows. Expert Syst. Appl. 40, 5997\u20136006 (2013)","journal-title":"Expert Syst. Appl."},{"key":"1551_CR2","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F., Laporte, G., Savelsbergh, M.W., Vigo, D: Vehicle routing. In: Handbooks in Operations Research and Management Science, vol. 14, pp. 367\u2013428 (2007)","DOI":"10.1016\/S0927-0507(06)14006-2"},{"key":"1551_CR3","unstructured":"Dimitris, B., Garrett, V.R.: The dynamic traveling repairman problem. In: Massachusetts Institute of Technology, Sloan School of Management (1989)"},{"key":"1551_CR4","unstructured":"Frederickson, G.N., Wittman, B., Speedup in the traveling repairman problem with constrained time windows. CoRR. arxiv:1101.3960 (2011)"},{"key":"1551_CR5","doi-asserted-by":"publisher","first-page":"40es","DOI":"10.1145\/1290672.1290677","volume":"3","author":"J Fakcharoenphol","year":"2007","unstructured":"Fakcharoenphol, J., Harrelson, C., Rao, S.: The k-traveling repairmen problem. ACM Trans. Algorithms 3, 40es (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"1551_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.endm.2017.03.009","volume":"58","author":"S Frifita","year":"2017","unstructured":"Frifita, S., Masmoudi, M., Euchi, J.: General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits. Electron. Notes Discrete Math. J. 58, 63\u201370 (2017)","journal-title":"Electron. Notes Discrete Math. J."},{"issue":"1","key":"1551_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1111\/itor.12604","volume":"27","author":"S Frifita","year":"2020","unstructured":"Frifita, S., Masmoudi, M.: VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties. Int. Trans. Oper. Res. 27(1), 291\u2013313 (2020)","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"1551_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"B Golden","year":"1984","unstructured":"Golden, B., Assad, A., Levy, L., Gheysens, F.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11(1), 49\u201366 (1984)","journal-title":"Comput. Oper. Res."},{"key":"1551_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/net.10031","volume":"40","author":"A Garc\u00eda","year":"2002","unstructured":"Garc\u00eda, A., Jodr\u00e1, P., Tejel, J.: A note on the traveling repairman problem. Networks 40, 27\u201331 (2002)","journal-title":"Networks"},{"issue":"3","key":"1551_CR10","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1016\/j.ejor.2016.01.038","volume":"252","author":"G Hiermann","year":"2016","unstructured":"Hiermann, G., Puchinger, J., Ropke, S., Hartl, R.F.: The electric fleet size and mix vehicle routing problem with time windows and recharging stations. Eur. J. Oper. Res. 252(3), 995\u20131018 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1551_CR11","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. 4OR 6(4), 319\u2013360 (2008)","journal-title":"4OR"},{"key":"1551_CR12","doi-asserted-by":"crossref","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.B., Solomon, M.M., Vehicle routing problem with time windows. In: Column Generation, pp. 67\u201398. Springer, Boston (2005)","DOI":"10.1007\/0-387-25486-2_3"},{"key":"1551_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.endm.2014.11.037","volume":"47","author":"M Kammoun","year":"2015","unstructured":"Kammoun, M., Derbel, H., Ratli, M., Jarboui, B.: A variable neighborhood search for solving the multi-vehicle covering tour problem. Electron. Notes Discrete Math. 47, 285\u2013292 (2015)","journal-title":"Electron. Notes Discrete Math."},{"key":"1551_CR14","unstructured":"Mathlouthi, I., Gendreau, M., Potvin, J.Y: Branch-and-price for a multi-attribute technician routing and scheduling problem. In: CIRRELT, Centre interuniversitaire de recherche sur les r\u00e9seaux d\u2019entreprise, la logistique et le transport Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (2017)"},{"issue":"1","key":"1551_CR15","first-page":"33","volume":"56","author":"I Mathlouthi","year":"2018","unstructured":"Mathlouthi, I., Gendreau, M., Potvin, J.Y.: Mixed integer linear programming for a multi-attribute technician routing and scheduling problem. Inf. Syst. Oper. Res. 56(1), 33\u201349 (2018)","journal-title":"Inf. Syst. Oper. Res."},{"key":"1551_CR16","unstructured":"Mathlouthi, I., Gendreau, M., Potvin, J.Y: A metaheuristic based on Tabu search for solving a technician routing and scheduling problem. In: CIRRELT, Centre interuniversitaire de recherche sur les r\u00e9seaux d\u2019entreprise, la logistique et le transport=Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (2018)"},{"issue":"11","key":"1551_CR17","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1551_CR18","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1111\/itor.12282","volume":"24","author":"A Mjirda","year":"2016","unstructured":"Mjirda, A., Todosijevic, R., Hanafi, S., Hansen, P., Mladenovi\u0107, N.: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24, 615\u2013633 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"1551_CR19","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1057\/jors.2015.113","volume":"67","author":"S Nucamendi-Guill\u00e9n","year":"2016","unstructured":"Nucamendi-Guill\u00e9n, S., Mart\u00ednez-Salazar, I., Angel-Bello, F., Moreno-Vega, J.M.: A mixed integer formulation and an efficient metaheuristic procedure for the k-travelling repairmen problem. J. Oper. Res. Soc. 67, 1121\u20131134 (2016)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"1551_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, \u00c9.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1(1), 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"key":"1551_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10288-011-0153-0","volume":"9","author":"A Salehipour","year":"2011","unstructured":"Salehipour, A., S\u00f3rensen, K., Goos, P., Br\u00e1ysy, O.: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR 9, 189\u2013209 (2011)","journal-title":"4OR"},{"issue":"1","key":"1551_CR22","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40(1), 475\u2013489 (2013)","journal-title":"Comput. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01551-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-020-01551-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01551-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T07:58:47Z","timestamp":1613721527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-020-01551-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,19]]},"references-count":22,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1551"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01551-w","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2020,2,19]]},"assertion":[{"value":"22 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}