{"id":"https://openalex.org/W3185606095","doi":"https://doi.org/10.1007/s42979-021-00779-2","title":"Learning 2-Opt Heuristics for Routing Problems via Deep Reinforcement Learning","display_name":"Learning 2-Opt Heuristics for Routing Problems via Deep Reinforcement Learning","publication_year":2021,"publication_date":"2021-07-23","ids":{"openalex":"https://openalex.org/W3185606095","doi":"https://doi.org/10.1007/s42979-021-00779-2","mag":"3185606095"},"language":"en","primary_location":{"id":"doi:10.1007/s42979-021-00779-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-021-00779-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-021-00779-2.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["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":"SN Computer Science","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/s42979-021-00779-2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035111273","display_name":"Paulo da Costa","orcid":"https://orcid.org/0000-0003-0509-8724"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Paulo da Costa","raw_affiliation_strings":["School of Industrial Engineering, Eindhoven University of Technology, 5612 AZ, Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-0509-8724","affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Eindhoven University of Technology, 5612 AZ, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062973890","display_name":"Jason Rhuggenaath","orcid":"https://orcid.org/0000-0001-5368-2947"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jason Rhuggenaath","raw_affiliation_strings":["School of Industrial Engineering, Eindhoven University of Technology, 5612 AZ, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Eindhoven University of Technology, 5612 AZ, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077147157","display_name":"Yingqian Zhang","orcid":"https://orcid.org/0000-0002-5073-0787"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Yingqian Zhang","raw_affiliation_strings":["School of Industrial Engineering, Eindhoven University of Technology, 5612 AZ, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Eindhoven University of Technology, 5612 AZ, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067635161","display_name":"Alp Ak\u00e7ay","orcid":"https://orcid.org/0000-0003-2000-6816"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alp Akcay","raw_affiliation_strings":["School of Industrial Engineering, Eindhoven University of Technology, 5612 AZ, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Eindhoven University of Technology, 5612 AZ, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080242338","display_name":"Uzay Kaymak","orcid":"https://orcid.org/0000-0002-4500-9098"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Uzay Kaymak","raw_affiliation_strings":["School of Industrial Engineering, Eindhoven University of Technology, 5612 AZ, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Eindhoven University of Technology, 5612 AZ, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035111273"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":7.1355,"has_fulltext":true,"cited_by_count":81,"citation_normalized_percentile":{"value":0.97296371,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"2","issue":"5","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9984999895095825,"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.9984999895095825,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9514999985694885,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/heuristics","display_name":"Heuristics","score":0.8620941638946533},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.8417983651161194},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6934384703636169},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6675094962120056},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6401667594909668},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6321738958358765},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6166842579841614},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4954901933670044},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.48510539531707764},{"id":"https://openalex.org/keywords/deep-learning","display_name":"Deep learning","score":0.4627841114997864},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4536837339401245},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.4303652346134186},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20185363292694092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1851871907711029}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8620941638946533},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.8417983651161194},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6934384703636169},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6675094962120056},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6401667594909668},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6321738958358765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6166842579841614},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4954901933670044},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.48510539531707764},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.4627841114997864},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4536837339401245},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.4303652346134186},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20185363292694092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1851871907711029},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s42979-021-00779-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-021-00779-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-021-00779-2.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["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":"SN Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/a92f9a67-6360-42ec-88f1-45ebf73febb4","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/a92f9a67-6360-42ec-88f1-45ebf73febb4","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de O. da Costa, P R, Rhuggenaath, J, Zhang, Y, Akcay, A & Kaymak, U 2021, 'Learning 2-Opt Heuristics for Routing Problems via Deep Reinforcement Learning', SN Computer Science, vol. 2, no. 5, 388. https://doi.org/10.1007/s42979-021-00779-2","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a92f9a67-6360-42ec-88f1-45ebf73febb4","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/a92f9a67-6360-42ec-88f1-45ebf73febb4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"SN Computer Science, 2(5):388. Springer Nature","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s42979-021-00779-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-021-00779-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-021-00779-2.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["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":"SN Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4454497801","display_name":"Real-time data-driven maintenance logistics","funder_award_id":"628.009.012","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3185606095.pdf","grobid_xml":"https://content.openalex.org/works/W3185606095.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W626292722","https://openalex.org/W1597286183","https://openalex.org/W2033320243","https://openalex.org/W2042986967","https://openalex.org/W2044683982","https://openalex.org/W2050819731","https://openalex.org/W2055569927","https://openalex.org/W2064675550","https://openalex.org/W2119717200","https://openalex.org/W2139059344","https://openalex.org/W2153654605","https://openalex.org/W2163428398","https://openalex.org/W2165142526","https://openalex.org/W2251882317","https://openalex.org/W2507756961","https://openalex.org/W2519887557","https://openalex.org/W2560592986","https://openalex.org/W2795112307","https://openalex.org/W2805798351","https://openalex.org/W2846823501","https://openalex.org/W2884711234","https://openalex.org/W2900896126","https://openalex.org/W2912555327","https://openalex.org/W2948433391","https://openalex.org/W2951430899","https://openalex.org/W2962979969","https://openalex.org/W2964043796","https://openalex.org/W2964121744","https://openalex.org/W2987288550","https://openalex.org/W2990626178","https://openalex.org/W2996204157","https://openalex.org/W3040879766","https://openalex.org/W3080626793","https://openalex.org/W3097400948","https://openalex.org/W3107359062","https://openalex.org/W3132134635","https://openalex.org/W3185606095","https://openalex.org/W4252801674"],"related_works":["https://openalex.org/W2031913815","https://openalex.org/W3119129187","https://openalex.org/W2470251263","https://openalex.org/W2193306078","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W4297427155","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803"],"abstract_inverted_index":{"Abstract":[0],"Recent":[1],"works":[2],"using":[3],"deep":[4,81,149],"learning":[5,20,150],"to":[6,39,70,90,121,164],"solve":[7],"routing":[8],"problems":[9],"such":[10,33],"as":[11,34],"the":[12,131,153,161,168,170,174],"traveling":[13],"salesman":[14],"problem":[15],"(TSP)":[16],"have":[17,49],"focused":[18,50],"on":[19,51,77,180],"construction":[21],"heuristics.":[22],"Such":[23],"approaches":[24],"find":[25],"good":[26],"quality":[27],"solutions":[28,41,140,144],"but":[29],"require":[30],"additional":[31],"procedures":[32],"beam":[35],"search":[36,74],"and":[37,42,141,173,185],"sampling":[38],"improve":[40,135],"achieve":[43],"state-of-the-art":[44,148],"performance.":[45],"However,":[46],"few":[47],"studies":[48],"improvement":[52],"heuristics,":[53],"where":[54],"a":[55,62,72,86,92,100,106,112],"given":[56,99],"solution":[57],"is":[58],"improved":[59],"until":[60],"reaching":[61],"near-optimal":[63,143],"one.":[64],"In":[65],"this":[66],"work,":[67],"we":[68,104,158],"propose":[69,85],"learn":[71,91],"local":[73],"heuristic":[75],"based":[76],"2-opt":[78,97],"operators":[79],"via":[80],"reinforcement":[82],"learning.":[83],"We":[84,155],"policy":[87,94,107],"gradient":[88],"algorithm":[89],"stochastic":[93],"that":[95,110,130],"selects":[96],"operations":[98],"current":[101],"solution.":[102],"Moreover,":[103],"introduce":[105],"neural":[108],"network":[109],"leverages":[111],"pointing":[113],"attention":[114],"mechanism,":[115],"which":[116],"can":[117,134,159],"be":[118],"easily":[119],"extended":[120],"more":[122],"general":[123],"k":[124],"-opt":[125],"moves.":[126],"Our":[127],"results":[128,179],"show":[129,157],"learned":[132,186],"policies":[133],"even":[136],"over":[137],"random":[138],"initial":[139],"approach":[142],"faster":[145],"than":[146],"previous":[147],"methods":[151],"for":[152],"TSP.":[154],"also":[156],"adapt":[160],"proposed":[162],"method":[163],"two":[165],"extensions":[166],"of":[167],"TSP:":[169],"multiple":[171],"TSP":[172],"Vehicle":[175],"Routing":[176],"Problem,":[177],"achieving":[178],"par":[181],"with":[182],"classical":[183],"heuristics":[184],"methods.":[187]},"counts_by_year":[{"year":2026,"cited_by_count":12},{"year":2025,"cited_by_count":20},{"year":2024,"cited_by_count":17},{"year":2023,"cited_by_count":19},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":5}],"updated_date":"2026-07-04T07:58:01.006859","created_date":"2021-08-02T00:00:00"}