{"id":"https://openalex.org/W2604582660","doi":"https://doi.org/10.1145/3036290.3036305","title":"Global Minimum Elastic Net for the Euclidean Travelling Salesman Problem","display_name":"Global Minimum Elastic Net for the Euclidean Travelling Salesman Problem","publication_year":2017,"publication_date":"2017-01-13","ids":{"openalex":"https://openalex.org/W2604582660","doi":"https://doi.org/10.1145/3036290.3036305","mag":"2604582660"},"language":"en","primary_location":{"id":"doi:10.1145/3036290.3036305","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3036290.3036305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 International Conference on Machine Learning and Soft Computing","raw_type":"proceedings-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/A5007298740","display_name":"Imaculate Mosha","orcid":null},"institutions":[{"id":"https://openalex.org/I157614274","display_name":"University of Cape Town","ror":"https://ror.org/03p74gp79","country_code":"ZA","type":"education","lineage":["https://openalex.org/I157614274"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"Imaculate Mosha","raw_affiliation_strings":["University of CapeTown Rondebosch, CapeTown, South Africa"],"affiliations":[{"raw_affiliation_string":"University of CapeTown Rondebosch, CapeTown, South Africa","institution_ids":["https://openalex.org/I157614274"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007298740"],"corresponding_institution_ids":["https://openalex.org/I157614274"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02928752,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"122","last_page":"125"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9968000054359436,"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/T10320","display_name":"Neural Networks and Applications","score":0.9904000163078308,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9805999994277954,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8571929931640625},{"id":"https://openalex.org/keywords/elastic-net-regularization","display_name":"Elastic net regularization","score":0.68549644947052},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6080237030982971},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.598677933216095},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5942539572715759},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5486916899681091},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5093201398849487},{"id":"https://openalex.org/keywords/net","display_name":"Net (polyhedron)","score":0.49988579750061035},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4883729815483093},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.43749701976776123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3974344730377197},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36686772108078003},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19484823942184448},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1804431974887848},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09125864505767822}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8571929931640625},{"id":"https://openalex.org/C203868755","wikidata":"https://www.wikidata.org/wiki/Q5353562","display_name":"Elastic net regularization","level":3,"score":0.68549644947052},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6080237030982971},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.598677933216095},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5942539572715759},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5486916899681091},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5093201398849487},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.49988579750061035},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4883729815483093},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.43749701976776123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3974344730377197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36686772108078003},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19484823942184448},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1804431974887848},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09125864505767822},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3036290.3036305","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3036290.3036305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 International Conference on Machine Learning and Soft Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8500000238418579,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W1481178682","https://openalex.org/W1717440967","https://openalex.org/W1839839470","https://openalex.org/W1990517717","https://openalex.org/W2017708378","https://openalex.org/W2024060531","https://openalex.org/W2044683982","https://openalex.org/W2051719061","https://openalex.org/W2059608229","https://openalex.org/W2115886818","https://openalex.org/W2156885886","https://openalex.org/W2160978415","https://openalex.org/W2163428398","https://openalex.org/W2170105430","https://openalex.org/W2783804122","https://openalex.org/W4233756358","https://openalex.org/W4300005723"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2361554335","https://openalex.org/W4200179302","https://openalex.org/W8433631","https://openalex.org/W4220987199","https://openalex.org/W2362402143"],"abstract_inverted_index":{"The":[0,47,93,115],"Travelling":[1],"Salesman":[2,91],"Problem":[3],"belongs":[4],"to":[5,29,87,109,119,139],"the":[6,30,44,65,73,76,84,89,99,112,121,126,137,157],"class":[7],"of":[8,52,55,75,83,145,160],"NP":[9],"(Non":[10],"Deterministic":[11],"Polynomial)":[12],"Complete":[13],"problems.":[14],"It":[15,69],"can":[16],"be":[17],"solved":[18],"by":[19,71,102,124],"Exact":[20],"or":[21],"heuristic":[22],"algorithms.":[23],"Heuristic":[24],"algorithms":[25,36],"find":[26],"approximate":[27],"solutions":[28],"problems":[31],"and":[32,43,57,105],"include":[33],"Neural":[34],"Network":[35],"such":[37],"as":[38],"Hopfield":[39],"Network,":[40],"Self-Organizing":[41],"Map":[42],"Elastic":[45,48,85,95,153],"Net.":[46],"Net":[49,86,96,154],"is":[50,106,133],"made":[51],"a":[53,58,81,130,141],"network":[54,138],"neurons":[56,127],"defined":[59],"energy":[60,74,100],"function":[61],"whose":[62],"minimum":[63,101,123,132],"renders":[64],"most":[66],"optimal":[67],"configuration.":[68,77],"proceeds":[70],"minimizing":[72],"This":[78,135],"article":[79],"proposes":[80],"variant":[82],"solve":[88],"Traveling":[90],"Problem.":[92],"original":[94],"algorithm":[97],"finds":[98],"gradient":[103],"descent":[104],"therefore":[107],"prone":[108],"conclude":[110],"at":[111,156],"local":[113,131],"minimum.":[114],"proposed":[116],"method":[117],"aims":[118],"reach":[120],"global":[122],"reinitializing":[125],"each":[128],"time":[129],"reached.":[134],"enables":[136],"explore":[140],"wider":[142],"sub":[143],"space":[144],"solutions.":[146],"Experiments":[147],"reveal":[148],"shorter":[149],"tours":[150],"than":[151],"other":[152],"variants":[155],"slight":[158],"expense":[159],"processing":[161],"time.":[162]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}