{"id":"https://openalex.org/W1989535981","doi":"https://doi.org/10.1016/0167-739x(94)00059-n","title":"A parallel 2-opt algorithm for the Traveling Salesman Problem","display_name":"A parallel 2-opt algorithm for the Traveling Salesman Problem","publication_year":1995,"publication_date":"1995-03-01","ids":{"openalex":"https://openalex.org/W1989535981","doi":"https://doi.org/10.1016/0167-739x(94)00059-n","mag":"1989535981"},"language":"en","primary_location":{"id":"doi:10.1016/0167-739x(94)00059-n","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-739x(94)00059-n","pdf_url":null,"source":{"id":"https://openalex.org/S186357190","display_name":"Future Generation Computer Systems","issn_l":"0167-739X","issn":["0167-739X","1872-7115"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Future Generation Computer Systems","raw_type":"journal-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/A5109890457","display_name":"M.G.A. Verhoeven","orcid":null},"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":"M.G.A. Verhoeven","raw_affiliation_strings":["Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands","Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111412969","display_name":"Emile Aarts","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122849","display_name":"Philips (Netherlands)","ror":"https://ror.org/02p2bgp27","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210122849"]},{"id":"https://openalex.org/I109147379","display_name":"NXP (Netherlands)","ror":"https://ror.org/059be4e97","country_code":"NL","type":"company","lineage":["https://openalex.org/I109147379"]},{"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":"E.H.L. Aarts","raw_affiliation_strings":["Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands","Philips Research Laboratories, P.O. Box 8000, 5600 JA Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Philips Research Laboratories, P.O. Box 8000, 5600 JA Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I109147379","https://openalex.org/I4210122849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041466549","display_name":"P.C.J. Swinkels","orcid":null},"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":"P.C.J. Swinkels","raw_affiliation_strings":["Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands","Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands#TAB#","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109890457"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":3340,"currency":"USD","value_usd":3340},"apc_paid":null,"fwci":1.765,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.86078283,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"11","issue":"2","first_page":"175","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983999729156494,"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.9983999729156494,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.983299970626831,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9819999933242798,"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.8817431926727295},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8567836284637451},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6831086277961731},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.606346607208252},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5752972364425659},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5276861190795898},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4262852072715759},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.412927508354187},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4003976583480835},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3687359690666199},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12159091234207153}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8817431926727295},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8567836284637451},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6831086277961731},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.606346607208252},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5752972364425659},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5276861190795898},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4262852072715759},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.412927508354187},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4003976583480835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3687359690666199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12159091234207153},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1016/0167-739x(94)00059-n","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-739x(94)00059-n","pdf_url":null,"source":{"id":"https://openalex.org/S186357190","display_name":"Future Generation Computer Systems","issn_l":"0167-739X","issn":["0167-739X","1872-7115"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Future Generation Computer Systems","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/6f2beb0e-5298-40bf-b6fa-0cb198796f9c","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/6f2beb0e-5298-40bf-b6fa-0cb198796f9c","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Verhoeven, M G A, Aarts, E H L & Swinkels, P C J 1995, 'A parallel 2-opt algorithm for the traveling salesman problem', Future Generation Computer Systems, vol. 11, no. 2, pp. 175-182. https://doi.org/10.1016/0167-739X(94)00059-N","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:tilburguniversity.edu:openaire_cris_publications/4b5d8f77-800a-4554-8ba8-69a63b30bac2","is_oa":false,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/4b5d8f77-800a-4554-8ba8-69a63b30bac2","pdf_url":null,"source":{"id":"https://openalex.org/S4406923027","display_name":"Tilburg University 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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Aarts, E H L, Swinkels, P C J & Verhoeven, M G A 1995, 'A parallel 2-opt algorithm for the traveling salesman problem', Future Generation Computer Systems, vol. 11, no. 2, pp. 175-182. https://doi.org/10.1016/0167-739X(94)00059-N","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:682764","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=682764","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0167-739X","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:682764","is_oa":false,"landing_page_url":"http://repository.tue.nl/682764","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0167-739X","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/6f2beb0e-5298-40bf-b6fa-0cb198796f9c","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/6f2beb0e-5298-40bf-b6fa-0cb198796f9c","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Future Generation Computer Systems, 11(2), 175 - 182. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7599999904632568,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1546457065","https://openalex.org/W1559215823","https://openalex.org/W1967317811","https://openalex.org/W2002425996","https://openalex.org/W2003718423","https://openalex.org/W2004182374","https://openalex.org/W2011039300","https://openalex.org/W2024060531","https://openalex.org/W2042986967","https://openalex.org/W2053913299","https://openalex.org/W2095546721","https://openalex.org/W2099337433","https://openalex.org/W2103981148","https://openalex.org/W2104670598","https://openalex.org/W2148673189","https://openalex.org/W2159224170","https://openalex.org/W2163428398","https://openalex.org/W2324108981","https://openalex.org/W4246598646","https://openalex.org/W6632882950","https://openalex.org/W6674474151","https://openalex.org/W6675207877"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W2980689483","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W2361554335","https://openalex.org/W1595757466","https://openalex.org/W2362402143","https://openalex.org/W2073288620","https://openalex.org/W2940752513"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-22T08:38:42.863108","created_date":"2025-10-10T00:00:00"}