{"id":"https://openalex.org/W2102308073","doi":"https://doi.org/10.1162/neco.1990.2.3.261","title":"Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem","display_name":"Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem","publication_year":1990,"publication_date":"1990-09-01","ids":{"openalex":"https://openalex.org/W2102308073","doi":"https://doi.org/10.1162/neco.1990.2.3.261","mag":"2102308073"},"language":"en","primary_location":{"id":"doi:10.1162/neco.1990.2.3.261","doi":"https://doi.org/10.1162/neco.1990.2.3.261","is_oa":false,"landing_page_url":"https://doi.org/10.1162/neco.1990.2.3.261","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,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","doyens","erih-plus","jufo-3","medline","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computation","raw_type":"journal-article"},"volume":null,"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/A5057866050","display_name":"Carsten Peterson","orcid":"https://orcid.org/0000-0001-7362-2191","observed_orcids":["https://orcid.org/0000-0001-7362-2191"]},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Carsten Peterson","raw_affiliation_strings":["Department of Theoretical Physics, University of Lund, S\u00f6lvegatan 14A, S-22362 Lund, Sweden","Department of Theoretical Physics, University of Lund, Solvegatan 14A, S-22362 Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Theoretical Physics, University of Lund, S\u00f6lvegatan 14A, S-22362 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Theoretical Physics, University of Lund, Solvegatan 14A, S-22362 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057866050"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":null,"apc_paid":null,"fwci":10.7485,"has_fulltext":false,"cited_by_count":102,"citation_normalized_percentile":{"value":0.98369002,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"2","issue":"3","first_page":"261","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9901999831199646,"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.9901999831199646,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.007400000002235174,"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.00039999998989515007,"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/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9929999709129333},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9879999756813049},{"id":"https://openalex.org/keywords/neural-network","display_name":"artificial neural networks","score":0.828000009059906},{"id":"https://openalex.org/keywords/elastic-net","display_name":"elastic net","score":0.8799999952316284},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9950000047683716},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":1.0},{"id":"https://openalex.org/keywords/hybrid-optimization","display_name":"hybrid optimization","score":0.5910000205039978},{"id":"https://openalex.org/keywords/benchmark-comparison","display_name":"benchmark comparison","score":0.5989999771118164}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.8504782915115356},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8499809503555298},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6821309924125671},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.6377341151237488},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5913547873497009},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.535148024559021},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.44334739446640015},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.44183552265167236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4365842938423157},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.43121248483657837},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4299584925174713},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4189121127128601},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34766557812690735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33871084451675415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25807756185531616},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.20272836089134216},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.11192306876182556},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1162/neco.1990.2.3.261","doi":"https://doi.org/10.1162/neco.1990.2.3.261","is_oa":false,"landing_page_url":"https://doi.org/10.1162/neco.1990.2.3.261","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,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","doyens","erih-plus","jufo-3","medline","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"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":"pmh:oai:CiteSeerX.psu:10.1.1.33.5050","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.5050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.thep.lu.se/pub/Preprints/90/lu_tp_90_02.ps.gz","raw_type":"text"},{"id":"pmh:oai:lup.lub.lu.se:f49134f8-294b-491a-b424-20fbd986d43f","doi":null,"is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/f49134f8-294b-491a-b424-20fbd986d43f","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1530-888X","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1597286183","https://openalex.org/W1604975506","https://openalex.org/W1831553804","https://openalex.org/W1965511886","https://openalex.org/W2010863474","https://openalex.org/W2013665974","https://openalex.org/W2024060531","https://openalex.org/W2044500926","https://openalex.org/W2051682049","https://openalex.org/W2051719061","https://openalex.org/W2061614302","https://openalex.org/W2077142771","https://openalex.org/W2084151718","https://openalex.org/W2089500395","https://openalex.org/W2132155210","https://openalex.org/W2136087206","https://openalex.org/W2148673189","https://openalex.org/W2149789787","https://openalex.org/W2212353926"],"related_works":["https://openalex.org/W1524531430","https://openalex.org/W2122334939","https://openalex.org/W2359044250","https://openalex.org/W2107955589","https://openalex.org/W2736822938","https://openalex.org/W2113422256","https://openalex.org/W2012515029","https://openalex.org/W7132091603","https://openalex.org/W7018119771","https://openalex.org/W2016303827"],"abstract_inverted_index":{"We":[0],"present":[1],"and":[2,9,31,51],"summarize":[3],"the":[4,15],"results":[5,36],"from":[6],"50-,":[7],"100-,":[8],"200-city":[10],"TSP":[11],"benchmarks":[12],"presented":[13],"at":[14],"1989":[16],"Neural":[17],"Information":[18],"Processing":[19],"Systems":[20],"(NIPS)":[21],"postconference":[22],"workshop":[23],"using":[24],"neural":[25],"network,":[26],"elastic":[27],"net,":[28],"genetic":[29],"algorithm,":[30],"simulated":[32,52],"annealing":[33],"approaches.":[34],"These":[35],"are":[37],"also":[38],"compared":[39],"with":[40],"a":[41],"state-of-the-art":[42],"hybrid":[43],"approach":[44],"consisting":[45],"of":[46],"greedy":[47],"solutions,":[48],"exhaustive":[49],"search,":[50],"annealing.":[53]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-09-12T09:15:50.089291","created_date":"2016-06-24T00:00:00"}