{"id":"https://openalex.org/W4210624921","doi":"https://doi.org/10.1007/s11590-021-01845-7","title":"The multi-depot k-traveling repairman problem","display_name":"The multi-depot k-traveling repairman problem","publication_year":2022,"publication_date":"2022-02-04","ids":{"openalex":"https://openalex.org/W4210624921","doi":"https://doi.org/10.1007/s11590-021-01845-7"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-021-01845-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-021-01845-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-021-01845-7.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11590-021-01845-7.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000467967","display_name":"Maria Elena Bruni","orcid":"https://orcid.org/0000-0002-3152-5294"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Maria Elena Bruni","raw_affiliation_strings":["Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Cosenza, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Cosenza, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024056760","display_name":"Sara Khodaparasti","orcid":"https://orcid.org/0000-0003-3858-2571"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Sara Khodaparasti","raw_affiliation_strings":["Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Cosenza, Italy"],"raw_orcid":"https://orcid.org/0000-0003-3858-2571","affiliations":[{"raw_affiliation_string":"Department of Mechanical, Energy and Management Engineering, University of Calabria, Rende, Cosenza, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024446714","display_name":"Iris Mart\u00ednez-Salazar","orcid":"https://orcid.org/0000-0002-0037-5764"},"institutions":[{"id":"https://openalex.org/I169046204","display_name":"Universidad Aut\u00f3noma de Nuevo Le\u00f3n","ror":"https://ror.org/01fh86n78","country_code":"MX","type":"education","lineage":["https://openalex.org/I169046204"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Iris Mart\u00ednez-Salazar","raw_affiliation_strings":["Graduated Program in Systems Engineering, Universidad Aut\u00f3noma de Nuevo Le\u00f3n, San Nicol\u00e1s de los Garza, Nuevo Le\u00f3n, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduated Program in Systems Engineering, Universidad Aut\u00f3noma de Nuevo Le\u00f3n, San Nicol\u00e1s de los Garza, Nuevo Le\u00f3n, Mexico","institution_ids":["https://openalex.org/I169046204"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047070984","display_name":"Samuel Nucamendi\u2010Guill\u00e9n","orcid":"https://orcid.org/0000-0003-4169-3395"},"institutions":[{"id":"https://openalex.org/I86613570","display_name":"Universidad Panamericana","ror":"https://ror.org/01n1q0h77","country_code":"MX","type":"education","lineage":["https://openalex.org/I86613570"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Samuel Nucamendi-Guill\u00e9n","raw_affiliation_strings":["Escuela de Ciencias Econ\u00f3micas y Empresariales, Universidad Panamericana, Zapopan, Jalisco, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Escuela de Ciencias Econ\u00f3micas y Empresariales, Universidad Panamericana, Zapopan, Jalisco, Mexico","institution_ids":["https://openalex.org/I86613570"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5000467967"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.6777,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73197284,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"16","issue":"9","first_page":"2681","last_page":"2709"},"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computational-intelligence","display_name":"Computational intelligence","score":0.7173358798027039},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.704265832901001},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.679326593875885},{"id":"https://openalex.org/keywords/depot","display_name":"Depot","score":0.6303789615631104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5866978764533997},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.532894492149353},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5210011601448059},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5135908126831055},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4946689307689667},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4874863624572754},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.4542028605937958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3121596872806549},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.17574962973594666},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16668426990509033},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14078542590141296}],"concepts":[{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.7173358798027039},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.704265832901001},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.679326593875885},{"id":"https://openalex.org/C2776561332","wikidata":"https://www.wikidata.org/wiki/Q5554853","display_name":"Depot","level":2,"score":0.6303789615631104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5866978764533997},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.532894492149353},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5210011601448059},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5135908126831055},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4946689307689667},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4874863624572754},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.4542028605937958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3121596872806549},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.17574962973594666},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16668426990509033},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14078542590141296},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11590-021-01845-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-021-01845-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-021-01845-7.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s11590-021-01845-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-021-01845-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-021-01845-7.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4210624921.pdf","grobid_xml":"https://content.openalex.org/works/W4210624921.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W25168650","https://openalex.org/W1512117524","https://openalex.org/W1778127384","https://openalex.org/W1966209162","https://openalex.org/W1966793805","https://openalex.org/W1975828823","https://openalex.org/W1979046925","https://openalex.org/W1999257035","https://openalex.org/W2002663664","https://openalex.org/W2013979699","https://openalex.org/W2020931444","https://openalex.org/W2030007454","https://openalex.org/W2035874923","https://openalex.org/W2056425817","https://openalex.org/W2058742972","https://openalex.org/W2060422572","https://openalex.org/W2061212893","https://openalex.org/W2062962786","https://openalex.org/W2068403188","https://openalex.org/W2077144156","https://openalex.org/W2088342306","https://openalex.org/W2111174053","https://openalex.org/W2119601963","https://openalex.org/W2132527960","https://openalex.org/W2148742122","https://openalex.org/W2153278891","https://openalex.org/W2308004816","https://openalex.org/W2470126219","https://openalex.org/W2590270828","https://openalex.org/W2606987170","https://openalex.org/W2793545721","https://openalex.org/W2836214552","https://openalex.org/W2907928238","https://openalex.org/W2974070813","https://openalex.org/W2985579309","https://openalex.org/W3040019279","https://openalex.org/W3047616087","https://openalex.org/W3116091122","https://openalex.org/W3148473839","https://openalex.org/W4232598359","https://openalex.org/W4250503569"],"related_works":["https://openalex.org/W2140318223","https://openalex.org/W2513094291","https://openalex.org/W2126939445","https://openalex.org/W2356976268","https://openalex.org/W4384346360","https://openalex.org/W1971327934","https://openalex.org/W931968541","https://openalex.org/W2148742122","https://openalex.org/W2993727830","https://openalex.org/W4210624921"],"abstract_inverted_index":{"Abstract":[0],"In":[1,57],"this":[2],"paper,":[3],"we":[4,67],"study":[5],"the":[6,15,21,28,33,36,39,51,64,89,95,100],"multi-depot":[7,22],"k":[8],"-traveling":[9],"repairman":[10,18],"problem.":[11],"This":[12],"problem":[13,19],"extends":[14],"traditional":[16],"traveling":[17],"to":[20,27,42,49,59,114,118],"case.":[23],"Its":[24],"objective,":[25],"similar":[26],"single":[29],"depot":[30],"variant,":[31],"is":[32,86],"minimization":[34],"of":[35,38,94,99],"sum":[37],"arrival":[40],"times":[41],"customers.":[43,120],"We":[44],"propose":[45,68],"two":[46],"distinct":[47],"formulations":[48,97],"model":[50],"problem,":[52],"obtained":[53],"on":[54],"layered":[55],"graphs.":[56],"order":[58],"find":[60],"feasible":[61],"solutions":[62,75],"for":[63],"largest":[65],"instances,":[66],"a":[69,79,83],"hybrid":[70],"genetic":[71,90],"algorithm":[72],"where":[73],"initial":[74],"are":[76,103,111],"built":[77],"using":[78],"splitting":[80],"heuristic":[81],"and":[82,98],"local":[84],"search":[85],"embedded":[87],"into":[88],"algorithm.":[91],"The":[92,108],"efficiency":[93],"mathematical":[96],"solution":[101],"approach":[102],"investigated":[104],"through":[105],"computational":[106],"experiments.":[107],"proposed":[109],"models":[110],"scalable":[112],"enough":[113],"solve":[115],"instances":[116],"up":[117],"240":[119]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}