{"id":"https://openalex.org/W2006092869","doi":"https://doi.org/10.1109/socpar.2013.7054102","title":"A survey on hybridizing genetic algorithm with dynamic programming for solving the traveling salesman problem","display_name":"A survey on hybridizing genetic algorithm with dynamic programming for solving the traveling salesman problem","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2006092869","doi":"https://doi.org/10.1109/socpar.2013.7054102","mag":"2006092869"},"language":"en","primary_location":{"id":"doi:10.1109/socpar.2013.7054102","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2013.7054102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","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/A5037098654","display_name":"Ph\u1ea1m \u0110\u00ecnh Th\u00e0nh","orcid":"https://orcid.org/0000-0002-2550-9546"},"institutions":[{"id":"https://openalex.org/I4210139842","display_name":"Tay Bac University","ror":"https://ror.org/04j5g5g52","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210139842"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Pham Dinh Thanh","raw_affiliation_strings":["Faculty of Mathematics - Physics - Informatic, Tay Bac University, Vietnam","Faculty of Mathematics - Physics - Informatic, Tay Bac University, SonLa, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics - Physics - Informatic, Tay Bac University, Vietnam","institution_ids":["https://openalex.org/I4210139842"]},{"raw_affiliation_string":"Faculty of Mathematics - Physics - Informatic, Tay Bac University, SonLa, Vietnam","institution_ids":["https://openalex.org/I4210139842"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072105691","display_name":"Hu\u1ef3nh Th\u1ecb Thanh B\u00ecnh","orcid":"https://orcid.org/0000-0003-1976-6113"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Huynh Thi Thanh Binh","raw_affiliation_strings":["School of Information and Communication Technology, HaNoi University of Science and Technology, Viet Nam","School of Information and Communication Technology HaNoi University of Science and Technology HaNoi, Viet Nam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, HaNoi University of Science and Technology, Viet Nam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"School of Information and Communication Technology HaNoi University of Science and Technology HaNoi, Viet Nam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102922886","display_name":"Lam Thu Bui","orcid":"https://orcid.org/0000-0002-9812-4970"},"institutions":[{"id":"https://openalex.org/I131359167","display_name":"Le Quy Don Technical University","ror":"https://ror.org/04wgyjv21","country_code":"VN","type":"education","lineage":["https://openalex.org/I131359167"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Bui Thu Lam","raw_affiliation_strings":["Faculty of Information Technology, Le Quy Don Technical University, Viet Nam","Faculty of Information Technology, Le Quy Don Technical University, Hanoi, Viet Nam#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Le Quy Don Technical University, Viet Nam","institution_ids":["https://openalex.org/I131359167"]},{"raw_affiliation_string":"Faculty of Information Technology, Le Quy Don Technical University, Hanoi, Viet Nam#TAB#","institution_ids":["https://openalex.org/I131359167"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4941,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.7572828,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"66","last_page":"71"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"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.9987999796867371,"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.9987999796867371,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9922999739646912,"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.9219328165054321},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.7015453577041626},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.59885573387146},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5694448947906494},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5644947290420532},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.537040650844574},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5256128311157227},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.4952613413333893},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.43303224444389343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32621023058891296},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2337331771850586},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2158757448196411}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9219328165054321},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.7015453577041626},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.59885573387146},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5694448947906494},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5644947290420532},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.537040650844574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5256128311157227},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.4952613413333893},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.43303224444389343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32621023058891296},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2337331771850586},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2158757448196411}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/socpar.2013.7054102","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2013.7054102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1512383952","https://openalex.org/W1542631934","https://openalex.org/W1573676079","https://openalex.org/W1781059203","https://openalex.org/W1839839470","https://openalex.org/W1897007268","https://openalex.org/W1969186119","https://openalex.org/W1977312644","https://openalex.org/W2008656089","https://openalex.org/W2015380770","https://openalex.org/W2018269848","https://openalex.org/W2024060531","https://openalex.org/W2042986967","https://openalex.org/W2067061580","https://openalex.org/W2067677003","https://openalex.org/W2096648407","https://openalex.org/W2116744205","https://openalex.org/W2124776405","https://openalex.org/W2125757417","https://openalex.org/W2129006915","https://openalex.org/W2140797420","https://openalex.org/W2285257517","https://openalex.org/W3147414854","https://openalex.org/W4292408555","https://openalex.org/W6632295784","https://openalex.org/W6656506093"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2362402143","https://openalex.org/W2265604726","https://openalex.org/W2033053473","https://openalex.org/W8433631"],"abstract_inverted_index":{"Traveling":[0],"Salesman":[1],"Problem":[2],"(TSP)":[3],"is":[4],"a":[5,29,47],"well-known":[6],"NP-hard":[7],"problem.":[8],"Many":[9],"algorithms":[10],"were":[11],"developed":[12],"to":[13,69,78],"solve":[14],"this":[15,54],"problem":[16,55],"and":[17,51,56],"gave":[18],"the":[19,32,71,74,79],"nearly":[20],"optimal":[21],"solutions":[22],"within":[23],"reasonable":[24],"time.":[25],"This":[26],"paper":[27],"presents":[28],"survey":[30],"about":[31],"combination":[33,48],"Genetic":[34],"Algorithm":[35],"(GA)":[36],"with":[37],"Dynamic":[38],"Programming":[39],"(DP)":[40],"for":[41,53],"solving":[42],"TSP.":[43],"We":[44],"also":[45],"setup":[46],"between":[49],"GA":[50],"DP":[52],"experimented":[57,75],"on":[58],"7":[59],"Euclidean":[60],"instances":[61],"derived":[62],"from":[63],"TSP-lib.":[64],"Experimental":[65],"results":[66],"are":[67],"reported":[68],"show":[70],"efficiency":[72],"of":[73],"algorithm":[76],"comparing":[77],"genetic":[80],"algorithm.":[81]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}