{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:30:24Z","timestamp":1781105424173,"version":"3.54.1"},"reference-count":23,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p>This article addresses a technician routing and scheduling problem inspired from an application for the repair of electronic transactions equipment. It consists of designing routes for staff to perform requests while considering certain constraints and resources. The objective is to minimize a linear combination of total weighted distance, overtime, and maximize the served requests. An efficient meta-heuristic algorithm based on variable neighborhood search with an adaptive memory and advanced diversity management method is proposed. Numerical results show that the meta-heuristic outperforms the best existing algorithm from the literature which is a Tabu Search.<\/jats:p>","DOI":"10.4018\/ijamc.2020010102","type":"journal-article","created":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T11:26:15Z","timestamp":1570015575000},"page":"23-35","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient VNS Algorithm to Solve the Multi-Attribute Technician Routing and Scheduling Problem"],"prefix":"10.4018","volume":"11","author":[{"given":"Sana","family":"Frifita","sequence":"first","affiliation":[{"name":"Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems (MODILS), Sfax, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ines","family":"Mathlouthi","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Operations Research, University of Montreal, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdelaziz","family":"Dammak","sequence":"additional","affiliation":[{"name":"Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems (MODILS), Sfax, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJAMC.2020010102-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.05.036"},{"key":"IJAMC.2020010102-1","doi-asserted-by":"publisher","DOI":"10.1287\/inte.33.1.67.12722"},{"key":"IJAMC.2020010102-2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8_23"},{"key":"IJAMC.2020010102-3","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601163"},{"key":"IJAMC.2020010102-4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.05.003"},{"key":"IJAMC.2020010102-5","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0545-0"},{"key":"IJAMC.2020010102-6","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1040.0117"},{"key":"IJAMC.2020010102-7","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12355"},{"key":"IJAMC.2020010102-8","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-011-0246-9"},{"key":"IJAMC.2020010102-9","doi-asserted-by":"crossref","unstructured":"Mathlouthi, I., Gendreau, M., & Potvin, J. Y. (2017). Branch-and-Price for a Multi-Attribute Technician Routing and Scheduling Problem. CIRRELT.","DOI":"10.1080\/03155986.2017.1335047"},{"key":"IJAMC.2020010102-10","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.2017.1335047"},{"key":"IJAMC.2020010102-11","unstructured":"Mathlouthi, I., Gendreau, M., & Potvin, J. Y. (2018). A Metaheuristic Based on Tabu Search for Solving a Technician Routing and Scheduling Problem. CIRRELT."},{"key":"IJAMC.2020010102-12","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"IJAMC.2020010102-13","unstructured":"Or, I. (1977). Traveling salesman type combinatorial problems and their relation to the logistics of regional blood banking."},{"key":"IJAMC.2020010102-14","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-012-0567-4"},{"key":"IJAMC.2020010102-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.09.012"},{"key":"IJAMC.2020010102-16","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90221-8"},{"key":"IJAMC.2020010102-17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02430370"},{"key":"IJAMC.2020010102-18","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"IJAMC.2020010102-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2006.03.004"},{"key":"IJAMC.2020010102-20","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(96)00042-9"},{"key":"IJAMC.2020010102-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.018"},{"key":"IJAMC.2020010102-22","doi-asserted-by":"publisher","DOI":"10.1287\/inte.29.1.112"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=239555","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T18:02:11Z","timestamp":1651773731000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJAMC.2020010102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":23,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.4018\/ijamc.2020010102","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}