{"id":"https://openalex.org/W1492852957","doi":"https://doi.org/10.1007/978-3-642-16054-7_5","title":"A New Approach for Solving the Generalized Traveling Salesman Problem","display_name":"A New Approach for Solving the Generalized Traveling Salesman Problem","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1492852957","doi":"https://doi.org/10.1007/978-3-642-16054-7_5","mag":"1492852957"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-16054-7_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16054-7_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5054561530","display_name":"Petric\u0103 C. Pop","orcid":"https://orcid.org/0000-0002-0626-9284"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. C. Pop","raw_affiliation_strings":["Dept. of Mathematics and Computer Science, North University of Baia Mare, Str. Victoriei, 430122, Baia Mare, Romania","Dept. of Mathematics and Computer Science, North University of Baia Mare, Baia Mare, Romania#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics and Computer Science, North University of Baia Mare, Str. Victoriei, 430122, Baia Mare, Romania","institution_ids":[]},{"raw_affiliation_string":"Dept. of Mathematics and Computer Science, North University of Baia Mare, Baia Mare, Romania#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071251605","display_name":"Oliviu Matei","orcid":"https://orcid.org/0000-0003-0319-8318"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"O. Matei","raw_affiliation_strings":["Dept. of Electrical Engineering, North University of Baia Mare, Str. V. Babes, 430083, Baia Mare, Romania","Dept. of Electrical Engineering, North University of Baia Mare, Baia Mare, Romania#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, North University of Baia Mare, Str. V. Babes, 430083, Baia Mare, Romania","institution_ids":[]},{"raw_affiliation_string":"Dept. of Electrical Engineering, North University of Baia Mare, Baia Mare, Romania#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019466406","display_name":"Cosmin Sabo","orcid":"https://orcid.org/0000-0002-5648-7191"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. Sabo","raw_affiliation_strings":["Dept. of Mathematics and Computer Science, North University of Baia Mare, Str. Victoriei, 430122, Baia Mare, Romania","Dept. of Mathematics and Computer Science, North University of Baia Mare, Baia Mare, Romania#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics and Computer Science, North University of Baia Mare, Str. Victoriei, 430122, Baia Mare, Romania","institution_ids":[]},{"raw_affiliation_string":"Dept. of Mathematics and Computer Science, North University of Baia Mare, Baia Mare, Romania#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":5.3119,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.95279279,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"62","last_page":"72"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"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.9991999864578247,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9988999962806702,"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.9940999746322632,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9463037252426147},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6860486268997192},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6780059933662415},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6735920906066895},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6017469167709351},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5664113163948059},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5259338021278381},{"id":"https://openalex.org/keywords/cross-entropy-method","display_name":"Cross-entropy method","score":0.4918051064014435},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4583948850631714},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4449404180049896},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4214750826358795},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34807857871055603},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29054075479507446},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.16371852159500122},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07584133744239807}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9463037252426147},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6860486268997192},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6780059933662415},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6735920906066895},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6017469167709351},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5664113163948059},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5259338021278381},{"id":"https://openalex.org/C75782508","wikidata":"https://www.wikidata.org/wiki/Q3333633","display_name":"Cross-entropy method","level":4,"score":0.4918051064014435},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4583948850631714},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4449404180049896},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4214750826358795},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34807857871055603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29054075479507446},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.16371852159500122},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07584133744239807},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-16054-7_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16054-7_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W108694910","https://openalex.org/W123765585","https://openalex.org/W1801390969","https://openalex.org/W1972335984","https://openalex.org/W1992507224","https://openalex.org/W2008656089","https://openalex.org/W2018269848","https://openalex.org/W2019741214","https://openalex.org/W2023947722","https://openalex.org/W2032789430","https://openalex.org/W2067061580","https://openalex.org/W2070484240","https://openalex.org/W2077405310","https://openalex.org/W2089196696","https://openalex.org/W2111415774","https://openalex.org/W2150367356","https://openalex.org/W2252898530","https://openalex.org/W2500153114"],"related_works":["https://openalex.org/W2946024655","https://openalex.org/W4200179302","https://openalex.org/W2081878758","https://openalex.org/W2758988501","https://openalex.org/W2189435634","https://openalex.org/W3013791021","https://openalex.org/W2123233098","https://openalex.org/W1987671593","https://openalex.org/W2156273071","https://openalex.org/W2146364482"],"abstract_inverted_index":null,"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":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}