{"id":"https://openalex.org/W3061663216","doi":"https://doi.org/10.1287/trsc.2020.0999","title":"Exact and Heuristic Algorithms for the Carrier\u2013Vehicle Traveling Salesman Problem","display_name":"Exact and Heuristic Algorithms for the Carrier\u2013Vehicle Traveling Salesman Problem","publication_year":2020,"publication_date":"2020-08-18","ids":{"openalex":"https://openalex.org/W3061663216","doi":"https://doi.org/10.1287/trsc.2020.0999","mag":"3061663216"},"language":"en","primary_location":{"id":"doi:10.1287/trsc.2020.0999","doi":"https://doi.org/10.1287/trsc.2020.0999","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.2020.0999","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-2","norway-2","poland-200","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/files/153908811/cvtsp_TS_Savelsbergh_suggestions_25_apr_2020.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057075821","display_name":"G\u00fcne\u015f Erdo\u011fan","orcid":"https://orcid.org/0000-0002-2456-3719","observed_orcids":["https://orcid.org/0000-0002-2456-3719"]},"institutions":[{"id":"https://openalex.org/I51601045","display_name":"University of Bath","ror":"https://ror.org/002h8g185","country_code":"GB","type":"education","lineage":["https://openalex.org/I51601045"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"G\u00fcne\u015f Erdo\u011fan","raw_affiliation_strings":["School of Management, University of Bath, Bath BA2 7AY, United Kingdom;","School of Management, University of Bath, Claverton Down, Bath, BA2 7AY, United Kingdom,"],"raw_orcid":"https://orcid.org/0000-0002-2456-3719","affiliations":[{"raw_affiliation_string":"School of Management, University of Bath, Bath BA2 7AY, United Kingdom;","institution_ids":["https://openalex.org/I51601045"]},{"raw_affiliation_string":"School of Management, University of Bath, Claverton Down, Bath, BA2 7AY, United Kingdom,","institution_ids":["https://openalex.org/I51601045"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057209882","display_name":"E. Alper Y\u0131ld\u0131r\u0131m","orcid":"https://orcid.org/0000-0003-4141-3189","observed_orcids":["https://orcid.org/0000-0003-4141-3189"]},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"E. Alper Y\u0131ld\u0131r\u0131m","raw_affiliation_strings":["School of Mathematics, The University of Edinburgh, Edinburgh EH9 3FD, United Kingdom","School of Mathematics, The University of Edinburgh, Peter Guthrie Tait Road, Edinburgh, EH9 3FD, United Kingdom,"],"raw_orcid":"https://orcid.org/0000-0003-4141-3189","affiliations":[{"raw_affiliation_string":"School of Mathematics, The University of Edinburgh, Edinburgh EH9 3FD, United Kingdom","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"School of Mathematics, The University of Edinburgh, Peter Guthrie Tait Road, Edinburgh, EH9 3FD, United Kingdom,","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057075821"],"corresponding_institution_ids":["https://openalex.org/I51601045"],"apc_list":null,"apc_paid":null,"fwci":1.7549,"has_fulltext":true,"cited_by_count":33,"citation_normalized_percentile":{"value":0.86287774,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"55","issue":"1","first_page":"101","last_page":"121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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":9.999999747378752e-05,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/optimality-cuts","display_name":"optimality cuts","score":0.9449999928474426},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"iterated local search","score":0.8840000033378601},{"id":"https://openalex.org/keywords/structural-properties","display_name":"structural properties","score":0.7120000123977661},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"vehicle routing","score":0.8159999847412109},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.5979999899864197}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8246971368789673},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.7927268147468567},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.659762978553772},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6088873147964478},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5776454210281372},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.5668261051177979},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5601182579994202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5473884344100952},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5340081453323364},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4659942388534546},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.43743085861206055},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.41067367792129517},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.36881011724472046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3638298511505127},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1287/trsc.2020.0999","doi":"https://doi.org/10.1287/trsc.2020.0999","is_oa":false,"landing_page_url":"https://doi.org/10.1287/trsc.2020.0999","pdf_url":null,"source":{"id":"https://openalex.org/S130252234","display_name":"Transportation Science","issn_l":"0041-1655","issn":["0041-1655","1526-5447"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-2","norway-2","poland-200","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transportation Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/0c6bd4f5-c625-4854-b83a-940a6b21370f","doi":null,"is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/0c6bd4f5-c625-4854-b83a-940a6b21370f","pdf_url":"https://www.research.ed.ac.uk/files/153908811/cvtsp_TS_Savelsbergh_suggestions_25_apr_2020.pdf","source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Erdo\u011fan, G & Yildirim, E A 2021, 'Exact and Heuristic Algorithms for the Carrier-Vehicle Traveling Salesman Problem', Transportation Science, vol. 55, no. 1, pp. 101-121. https://doi.org/10.1287/trsc.2020.0999","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:purehost.bath.ac.uk:openaire/36d762e7-0e53-4c03-adb0-c90002206fca","doi":null,"is_oa":true,"landing_page_url":"https://researchportal.bath.ac.uk/en/publications/36d762e7-0e53-4c03-adb0-c90002206fca","pdf_url":"https://purehost.bath.ac.uk/ws/files/206105241/cvtsp_TS_Savelsbergh_suggestions_25_apr_2020.pdf","source":{"id":"https://openalex.org/S4377196294","display_name":"Pure (University of Bath)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I51601045","host_organization_name":"University of Bath","host_organization_lineage":["https://openalex.org/I51601045"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Erdo\u011fan, G & Yildirim, E A 2021, 'Exact and Heuristic Algorithms for the Carrier-Vehicle Traveling Salesman Problem', Transportation Science, vol. 55, no. 1, pp. 101-121. https://doi.org/10.1287/trsc.2020.0999","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/0c6bd4f5-c625-4854-b83a-940a6b21370f","doi":null,"is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/0c6bd4f5-c625-4854-b83a-940a6b21370f","pdf_url":"https://www.research.ed.ac.uk/files/153908811/cvtsp_TS_Savelsbergh_suggestions_25_apr_2020.pdf","source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Erdo\u011fan, G & Yildirim, E A 2021, 'Exact and Heuristic Algorithms for the Carrier-Vehicle Traveling Salesman Problem', Transportation Science, vol. 55, no. 1, pp. 101-121. https://doi.org/10.1287/trsc.2020.0999","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.428600013256073}],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320322","display_name":"University of Bath","ror":"https://ror.org/002h8g185"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3061663216.pdf","grobid_xml":"https://content.openalex.org/works/W3061663216.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1966692948","https://openalex.org/W1977319619","https://openalex.org/W1994940434","https://openalex.org/W2025421018","https://openalex.org/W2047747795","https://openalex.org/W2059715080","https://openalex.org/W2059949797","https://openalex.org/W2076186575","https://openalex.org/W2093041021","https://openalex.org/W2107739573","https://openalex.org/W2110824994","https://openalex.org/W2118538911","https://openalex.org/W2136708107","https://openalex.org/W2141791003","https://openalex.org/W2163071153","https://openalex.org/W2245682929","https://openalex.org/W2252331779","https://openalex.org/W2253899129","https://openalex.org/W2528929878","https://openalex.org/W2754261999","https://openalex.org/W2754599614","https://openalex.org/W2883417042","https://openalex.org/W2915338839","https://openalex.org/W2940865666","https://openalex.org/W2986975079","https://openalex.org/W2990601306","https://openalex.org/W3121675905","https://openalex.org/W4248384829"],"related_works":["https://openalex.org/W3112607009","https://openalex.org/W2141056356","https://openalex.org/W2356976268","https://openalex.org/W2140318223","https://openalex.org/W2513094291","https://openalex.org/W4321062523","https://openalex.org/W2495211334","https://openalex.org/W931968541","https://openalex.org/W4289422914","https://openalex.org/W3061663216"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"new":[3,16,50],"structural":[4,29],"properties":[5],"for":[6],"the":[7,28,43,46,49,53,59,62,67],"carrier\u2013vehicle":[8],"traveling":[9],"salesman":[10],"problem.":[11],"The":[12],"authors":[13],"provide":[14],"a":[15],"mixed-integer":[17],"second-order":[18],"conic":[19],"optimization":[20],"formulation,":[21],"with":[22],"associated":[23],"optimality":[24],"cuts":[25],"based":[26],"on":[27,40],"properties,":[30],"and":[31,56,61],"an":[32],"iterated":[33],"local":[34],"search":[35],"(ILS)":[36],"algorithm.":[37,69],"Computational":[38],"experiments":[39],"instances":[41],"from":[42],"literature":[44],"demonstrate":[45],"superiority":[47],"of":[48],"formulation":[51],"to":[52],"existing":[54],"models":[55],"algorithms":[57],"in":[58],"literature,":[60],"high-quality":[63],"solutions":[64],"found":[65],"by":[66],"ILS":[68]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2025-10-10T00:00:00"}