{"id":"https://openalex.org/W2978805836","doi":"https://doi.org/10.4018/ijamc.2020010102","title":"An Efficient VNS Algorithm to Solve the Multi-Attribute Technician Routing and Scheduling Problem","display_name":"An Efficient VNS Algorithm to Solve the Multi-Attribute Technician Routing and Scheduling Problem","publication_year":2019,"publication_date":"2019-10-02","ids":{"openalex":"https://openalex.org/W2978805836","doi":"https://doi.org/10.4018/ijamc.2020010102","mag":"2978805836"},"language":"en","primary_location":{"id":"doi:10.4018/ijamc.2020010102","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijamc.2020010102","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084909154","display_name":"Sana Frifita","orcid":"https://orcid.org/0000-0001-6938-8216"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sana Frifita","raw_affiliation_strings":["Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems (MODILS), Sfax, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems (MODILS), Sfax, Tunisia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014603791","display_name":"Ines Mathlouthi","orcid":null},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ines Mathlouthi","raw_affiliation_strings":["Department of Computer Science and Operations Research, University of Montreal, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Operations Research, University of Montreal, Canada","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070454072","display_name":"Abdelaziz Dammak","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abdelaziz Dammak","raw_affiliation_strings":["Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems (MODILS), Sfax, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems (MODILS), Sfax, Tunisia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.221,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63000357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"1","first_page":"23","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.767881453037262},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7495169639587402},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.7129546403884888},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5314618349075317},{"id":"https://openalex.org/keywords/technician","display_name":"Technician","score":0.5094102025032043},{"id":"https://openalex.org/keywords/meta-heuristic","display_name":"Meta heuristic","score":0.45567071437835693},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4510948359966278},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4295971393585205},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.42709779739379883},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4255334138870239},{"id":"https://openalex.org/keywords/overtime","display_name":"Overtime","score":0.4148305654525757},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.41341981291770935},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3819118142127991},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3420032262802124},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18580448627471924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1436346471309662},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07583272457122803}],"concepts":[{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.767881453037262},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7495169639587402},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7129546403884888},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5314618349075317},{"id":"https://openalex.org/C2776229289","wikidata":"https://www.wikidata.org/wiki/Q5352191","display_name":"Technician","level":2,"score":0.5094102025032043},{"id":"https://openalex.org/C2988037039","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Meta heuristic","level":2,"score":0.45567071437835693},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4510948359966278},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4295971393585205},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.42709779739379883},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4255334138870239},{"id":"https://openalex.org/C2780407378","wikidata":"https://www.wikidata.org/wiki/Q667022","display_name":"Overtime","level":2,"score":0.4148305654525757},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.41341981291770935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3819118142127991},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3420032262802124},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18580448627471924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1436346471309662},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07583272457122803},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijamc.2020010102","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijamc.2020010102","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jamc00:v:11:y:2020:i:1:p:23-35","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2020010102","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W47875337","https://openalex.org/W1973769901","https://openalex.org/W2010334716","https://openalex.org/W2013031437","https://openalex.org/W2023242287","https://openalex.org/W2035874923","https://openalex.org/W2058419034","https://openalex.org/W2059816321","https://openalex.org/W2067732008","https://openalex.org/W2096305430","https://openalex.org/W2097409583","https://openalex.org/W2098163707","https://openalex.org/W2108980775","https://openalex.org/W2109101401","https://openalex.org/W2114712485","https://openalex.org/W2158000627","https://openalex.org/W2162508334","https://openalex.org/W2385288821","https://openalex.org/W2538162005","https://openalex.org/W2735962699","https://openalex.org/W3036211873","https://openalex.org/W3065110189","https://openalex.org/W3118945546"],"related_works":["https://openalex.org/W2054324039","https://openalex.org/W3016130416","https://openalex.org/W4213405972","https://openalex.org/W4214968415","https://openalex.org/W4298984571","https://openalex.org/W2026922968","https://openalex.org/W1981122776","https://openalex.org/W1964715746","https://openalex.org/W2765151454","https://openalex.org/W4237530617"],"abstract_inverted_index":{"This":[0],"article":[1],"addresses":[2],"a":[3,41,90],"technician":[4],"routing":[5],"and":[6,34,49,67],"scheduling":[7],"problem":[8],"inspired":[9],"from":[10,85],"an":[11,64],"application":[12],"for":[13,25],"the":[14,51,78,81,86],"repair":[15],"of":[16,22,44],"electronic":[17],"transactions":[18],"equipment.":[19],"It":[20],"consists":[21],"designing":[23],"routes":[24],"staff":[26],"to":[27,39],"perform":[28],"requests":[29],"while":[30],"considering":[31],"certain":[32],"constraints":[33],"resources.":[35],"The":[36],"objective":[37],"is":[38,72,89],"minimize":[40],"linear":[42],"combination":[43],"total":[45],"weighted":[46],"distance,":[47],"overtime,":[48],"maximize":[50],"served":[52],"requests.":[53],"An":[54],"efficient":[55],"meta-heuristic":[56,79],"algorithm":[57,84],"based":[58],"on":[59],"variable":[60],"neighborhood":[61],"search":[62],"with":[63],"adaptive":[65],"memory":[66],"advanced":[68],"diversity":[69],"management":[70],"method":[71],"proposed.":[73],"Numerical":[74],"results":[75],"show":[76],"that":[77],"outperforms":[80],"best":[82],"existing":[83],"literature":[87],"which":[88],"Tabu":[91],"Search.":[92]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}