{"id":"https://openalex.org/W2948433391","doi":"https://doi.org/10.48550/arxiv.1906.01227","title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","display_name":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","alternate_titles":[],"publication_year":2019,"publication_date":"2019-06-04","ids":{"openalex":"https://openalex.org/W2948433391","doi":"https://doi.org/10.48550/arxiv.1906.01227","mag":"2948433391"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:1906.01227","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1906.01227","pdf_url":"https://arxiv.org/pdf/1906.01227","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"parent_works":[],"lineage":["https://openalex.org/W2948433391"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1906.01227","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041429006","display_name":"Chaitanya K. Joshi","orcid":"https://orcid.org/0000-0003-4722-1815","observed_orcids":["https://orcid.org/0000-0003-4722-1815"]},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Joshi, Chaitanya K.","raw_affiliation_strings":["School of Computer Science and Engineering , Nanyang Technological University , Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering , Nanyang Technological University , Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024411628","display_name":"Thomas Laurent","orcid":"https://orcid.org/0000-0002-0953-774X","observed_orcids":["https://orcid.org/0000-0002-0953-774X","https://orcid.org/0000-0002-0013-8240"]},"institutions":[{"id":"https://openalex.org/I35566140","display_name":"Loyola Marymount University","ror":"https://ror.org/00xhj8c72","country_code":"US","type":"education","lineage":["https://openalex.org/I35566140"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Laurent, Thomas","raw_affiliation_strings":["Department of Mathematics , Loyola Marymount University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics , Loyola Marymount University","institution_ids":["https://openalex.org/I35566140"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031210396","display_name":"Xavier Bresson","orcid":"https://orcid.org/0000-0002-7109-461X","observed_orcids":["https://orcid.org/0000-0002-7109-461X","https://orcid.org/0009-0008-6599-2609"]},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Bresson, Xavier","raw_affiliation_strings":["School of Computer Science and Engineering , Nanyang Technological University , Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering , Nanyang Technological University , Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":641,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.8920999765396118,"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.8920999765396118,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.042399998754262924,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.03929999843239784,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9589999914169312},{"id":"https://openalex.org/keywords/graph-convolutional-networks","display_name":"graph convolutional networks","score":0.9929999709129333},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8109999895095825},{"id":"https://openalex.org/keywords/beam-search","display_name":"beam search","score":0.8859999775886536},{"id":"https://openalex.org/keywords/euclidean-graphs","display_name":"Euclidean graphs","score":0.6520000100135803},{"id":"https://openalex.org/keywords/optimality-gap","display_name":"optimality gap","score":0.6169999837875366}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8146399259567261},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6611924171447754},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6173716187477112},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5725687146186829},{"id":"https://openalex.org/C159877910","wikidata":"https://www.wikidata.org/wiki/Q2202883","display_name":"Autoregressive model","level":2,"score":0.49967527389526367},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.44257768988609314},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41481202840805054},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40578120946884155},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3593112528324127},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2983889579772949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22807976603507996},{"id":"https://openalex.org/C149782125","wikidata":"https://www.wikidata.org/wiki/Q160039","display_name":"Econometrics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:1906.01227","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1906.01227","pdf_url":"https://arxiv.org/pdf/1906.01227","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.1906.01227","doi":"https://doi.org/10.48550/arxiv.1906.01227","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1906.01227","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1906.01227","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1906.01227","pdf_url":"https://arxiv.org/pdf/1906.01227","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2948433391.pdf","grobid_xml":"https://content.openalex.org/works/W2948433391.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W626292722","https://openalex.org/W1522301498","https://openalex.org/W1597286183","https://openalex.org/W1652378708","https://openalex.org/W1662382123","https://openalex.org/W1757796397","https://openalex.org/W1836465849","https://openalex.org/W2029242918","https://openalex.org/W2033320243","https://openalex.org/W2044683982","https://openalex.org/W2055569927","https://openalex.org/W2058937865","https://openalex.org/W2074485628","https://openalex.org/W2106378689","https://openalex.org/W2116341502","https://openalex.org/W2117666205","https://openalex.org/W2119717200","https://openalex.org/W2130942839","https://openalex.org/W2133564696","https://openalex.org/W2154241802","https://openalex.org/W2194775991","https://openalex.org/W2299115575","https://openalex.org/W2399100674","https://openalex.org/W2402402867","https://openalex.org/W2468907370","https://openalex.org/W2507756961","https://openalex.org/W2519887557","https://openalex.org/W2525778437","https://openalex.org/W2558748708","https://openalex.org/W2560592986","https://openalex.org/W2600702321","https://openalex.org/W2607264901","https://openalex.org/W2624431344","https://openalex.org/W2766453196","https://openalex.org/W2768242641","https://openalex.org/W2785487749","https://openalex.org/W2787189213","https://openalex.org/W2795112307","https://openalex.org/W2805798351","https://openalex.org/W2891230096","https://openalex.org/W2900896126","https://openalex.org/W2912555327","https://openalex.org/W2922429874","https://openalex.org/W2964121744","https://openalex.org/W4394657357","https://openalex.org/W7223762255"],"related_works":["https://openalex.org/W2945625259","https://openalex.org/W3207032584","https://openalex.org/W7165132884","https://openalex.org/W3041070278","https://openalex.org/W4226363157","https://openalex.org/W6990669744","https://openalex.org/W4405802222","https://openalex.org/W3103176522","https://openalex.org/W4391847761","https://openalex.org/W4210271172"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,34],"new":[4],"learning-based":[5,97],"approach":[6,43,102],"for":[7,62,81,89,99],"approximately":[8],"solving":[9],"the":[10,73],"Travelling":[11],"Salesman":[12],"Problem":[13],"on":[14],"2D":[15],"Euclidean":[16],"graphs.":[17],"We":[18],"use":[19],"deep":[20,49],"Graph":[21],"Convolutional":[22],"Networks":[23],"to":[24,79,87],"build":[25],"efficient":[26],"TSP":[27],"graph":[28,67],"representations":[29],"and":[30,59,84],"output":[31],"tours":[32],"in":[33,52],"non-autoregressive":[35],"manner":[36],"via":[37],"highly":[38],"parallelized":[39],"beam":[40],"search.":[41],"Our":[42],"outperforms":[44],"all":[45],"recently":[46],"proposed":[47],"autoregressive":[48],"learning":[50],"techniques":[51],"terms":[53],"of":[54,65,105],"solution":[55],"quality,":[56],"inference":[57],"speed":[58],"sample":[60],"efficiency":[61],"problem":[63],"instances":[64],"fixed":[66],"sizes.":[68],"In":[69],"particular,":[70],"we":[71],"reduce":[72],"average":[74],"optimality":[75],"gap":[76],"from":[77,85],"0.52%":[78],"0.01%":[80],"50":[82],"nodes,":[83],"2.26%":[86],"1.39%":[88],"100":[90],"nodes.":[91],"Finally,":[92],"despite":[93],"improving":[94],"upon":[95],"other":[96],"approaches":[98],"TSP,":[100],"our":[101],"falls":[103],"short":[104],"standard":[106],"Operations":[107],"Research":[108],"solvers.":[109]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2948433391","counts_by_year":[{"year":2026,"cited_by_count":132},{"year":2025,"cited_by_count":116},{"year":2024,"cited_by_count":113},{"year":2023,"cited_by_count":90},{"year":2022,"cited_by_count":75},{"year":2021,"cited_by_count":83},{"year":2020,"cited_by_count":27},{"year":2019,"cited_by_count":5}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2019-06-14T00:00:00"}
