{"id":"https://openalex.org/W2101144650","doi":"https://doi.org/10.1162/08997660252741194","title":"A Neural-Network-Based Approach to the Double Traveling Salesman Problem","display_name":"A Neural-Network-Based Approach to the Double Traveling Salesman Problem","publication_year":2002,"publication_date":"2002-02-01","ids":{"openalex":"https://openalex.org/W2101144650","doi":"https://doi.org/10.1162/08997660252741194","mag":"2101144650","pmid":"https://pubmed.ncbi.nlm.nih.gov/11802920"},"language":"en","primary_location":{"id":"doi:10.1162/08997660252741194","is_oa":false,"landing_page_url":"https://doi.org/10.1162/08997660252741194","pdf_url":null,"source":{"id":"https://openalex.org/S207023548","display_name":"Neural Computation","issn_l":"0899-7667","issn":["0899-7667","1530-888X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5020474912","display_name":"Alessio Plebe","orcid":"https://orcid.org/0000-0003-3666-061X"},"institutions":[{"id":"https://openalex.org/I39063666","display_name":"University of Catania","ror":"https://ror.org/03a64bh57","country_code":"IT","type":"education","lineage":["https://openalex.org/I39063666"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alessio Plebe","raw_affiliation_strings":["Department of Mathematics and Informatics, University of Catania 8 I-95125 Catania, Italy,","Department of Mathematics and Informatics, University of Catania 8 I-95125 Catania, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Informatics, University of Catania 8 I-95125 Catania, Italy,","institution_ids":["https://openalex.org/I39063666"]},{"raw_affiliation_string":"Department of Mathematics and Informatics, University of Catania 8 I-95125 Catania, Italy","institution_ids":["https://openalex.org/I39063666"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008485128","display_name":"A. M. Anile","orcid":null},"institutions":[{"id":"https://openalex.org/I39063666","display_name":"University of Catania","ror":"https://ror.org/03a64bh57","country_code":"IT","type":"education","lineage":["https://openalex.org/I39063666"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Angelo Marcello Anile","raw_affiliation_strings":["Department of Mathematics and Informatics, University of Catania 8 I-95125 Catania, Italy,","Department of Mathematics and Informatics, University of Catania 8 I-95125 Catania, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Informatics, University of Catania 8 I-95125 Catania, Italy,","institution_ids":["https://openalex.org/I39063666"]},{"raw_affiliation_string":"Department of Mathematics and Informatics, University of Catania 8 I-95125 Catania, Italy","institution_ids":["https://openalex.org/I39063666"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I39063666"],"apc_list":null,"apc_paid":null,"fwci":0.8529,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.77903186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"2","first_page":"437","last_page":"471"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9977999925613403,"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.9977999925613403,"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.9929999709129333,"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"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9908999800682068,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9554190039634705},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6243091821670532},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5896464586257935},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.587232232093811},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5530579090118408},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5334377884864807},{"id":"https://openalex.org/keywords/winner-take-all","display_name":"Winner-take-all","score":0.5228515267372131},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.5131943821907043},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4940395951271057},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48718875646591187},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.48543840646743774},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4721009135246277},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4697345197200775},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4635521471500397},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4495559334754944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37597787380218506},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3525117039680481},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32438063621520996}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9554190039634705},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6243091821670532},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5896464586257935},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.587232232093811},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5530579090118408},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5334377884864807},{"id":"https://openalex.org/C168976158","wikidata":"https://www.wikidata.org/wiki/Q769931","display_name":"Winner-take-all","level":3,"score":0.5228515267372131},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5131943821907043},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4940395951271057},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48718875646591187},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.48543840646743774},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4721009135246277},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4697345197200775},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4635521471500397},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4495559334754944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37597787380218506},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3525117039680481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32438063621520996},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1162/08997660252741194","is_oa":false,"landing_page_url":"https://doi.org/10.1162/08997660252741194","pdf_url":null,"source":{"id":"https://openalex.org/S207023548","display_name":"Neural Computation","issn_l":"0899-7667","issn":["0899-7667","1530-888X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computation","raw_type":"journal-article"},{"id":"pmid:11802920","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/11802920","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural computation","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W23758216","https://openalex.org/W307896644","https://openalex.org/W1486993561","https://openalex.org/W1546822455","https://openalex.org/W1597286183","https://openalex.org/W1601925049","https://openalex.org/W1679913846","https://openalex.org/W1848550669","https://openalex.org/W1927348646","https://openalex.org/W1968143987","https://openalex.org/W1970412155","https://openalex.org/W1979366255","https://openalex.org/W1990517717","https://openalex.org/W1991848143","https://openalex.org/W2000882837","https://openalex.org/W2005355041","https://openalex.org/W2005584643","https://openalex.org/W2013525411","https://openalex.org/W2016346036","https://openalex.org/W2016420859","https://openalex.org/W2017708378","https://openalex.org/W2022179164","https://openalex.org/W2029681015","https://openalex.org/W2033320243","https://openalex.org/W2040678783","https://openalex.org/W2042986967","https://openalex.org/W2045312576","https://openalex.org/W2051719061","https://openalex.org/W2061153180","https://openalex.org/W2061609059","https://openalex.org/W2074214469","https://openalex.org/W2074485628","https://openalex.org/W2084507157","https://openalex.org/W2089438500","https://openalex.org/W2090390706","https://openalex.org/W2099011086","https://openalex.org/W2113422256","https://openalex.org/W2117226423","https://openalex.org/W2122334939","https://openalex.org/W2125350144","https://openalex.org/W2156746119","https://openalex.org/W2161124816","https://openalex.org/W2163428398","https://openalex.org/W2169357647","https://openalex.org/W2956015669","https://openalex.org/W3125454521","https://openalex.org/W4206318793","https://openalex.org/W4252060579","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2356976268","https://openalex.org/W2032109086","https://openalex.org/W2046552997","https://openalex.org/W810420948","https://openalex.org/W2308371765","https://openalex.org/W121123127","https://openalex.org/W2366076337","https://openalex.org/W2184672982","https://openalex.org/W71502349","https://openalex.org/W931968541"],"abstract_inverted_index":{"The":[0,25,57],"double":[1,184],"traveling":[2,11,174],"salesman":[3,12,175],"problem":[4,13,27,176],"is":[5,60,89,117,148],"a":[6,45,54,63,96,173],"variation":[7],"of":[8,35,44,76,82,86,92,122,141,167,178],"the":[9,33,36,40,74,83,87,90,106,112,115,120,125,132,137,145,157,161,179,183],"basic":[10],"where":[14],"targets":[15,77],"can":[16],"be":[17,79],"reached":[18],"by":[19,29,172],"two":[20,41,138],"salespersons":[21],"operating":[22],"in":[23,105,131],"parallel.":[24],"real":[26],"addressed":[28],"this":[30],"work":[31],"concerns":[32],"optimization":[34],"harvest":[37,153],"sequence":[38,154],"for":[39,98,152,186],"independent":[42],"arms":[43],"fruit-harvesting":[46],"robot.":[47],"This":[48,127],"application":[49],"poses":[50],"further":[51],"constraints,":[52],"like":[53],"collision-avoidance":[55],"function.":[56],"proposed":[58,146],"solution":[59],"based":[61],"on":[62],"self-organizing":[64,163],"map":[65,164],"structure,":[66],"initialized":[67],"with":[68,95,119],"as":[69,73,170],"many":[70],"artificial":[71,102],"neurons":[72,116,123],"number":[75],"to":[78,160],"reached.":[80],"One":[81],"key":[84],"components":[85],"process":[88],"combination":[91],"competitive":[93,107],"relaxation":[94,108],"mechanism":[97],"deleting":[99],"and":[100,134,150],"creating":[101],"neurons.":[103],"Moreover,":[104,156],"process,":[109],"information":[110],"about":[111],"trajectory":[113,133],"connecting":[114],"combined":[118],"distance":[121],"from":[124,182],"target.":[126],"strategy":[128],"prevents":[129],"tangles":[130],"collisions":[135],"between":[136],"tours.":[139],"Results":[140],"tests":[142],"indicate":[143],"that":[144],"approach":[147],"efficient":[149],"reliable":[151],"planning.":[155],"enhancements":[158],"added":[159],"pure":[162],"concept":[165],"are":[166],"wider":[168],"importance,":[169],"proved":[171],"version":[177,185],"program,":[180],"simplified":[181],"comparison.":[187]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}