{"id":"https://openalex.org/W2289574540","doi":"https://doi.org/10.1109/taai.2015.7407102","title":"An effective combination of Genetic Algorithms and the Variable Neighborhood Search for solving Travelling Salesman Problem","display_name":"An effective combination of Genetic Algorithms and the Variable Neighborhood Search for solving Travelling Salesman Problem","publication_year":2015,"publication_date":"2015-11-01","ids":{"openalex":"https://openalex.org/W2289574540","doi":"https://doi.org/10.1109/taai.2015.7407102","mag":"2289574540"},"language":"en","primary_location":{"id":"doi:10.1109/taai.2015.7407102","is_oa":false,"landing_page_url":"https://doi.org/10.1109/taai.2015.7407102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI)","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":null,"display_name":"Dinh Thanh Pham","orcid":null},"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":"Dinh Thanh Pham","raw_affiliation_strings":["Taybac University, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Taybac University, Vietnam","institution_ids":["https://openalex.org/I4210139842"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074202712","display_name":"Thi Thanh Binh Huynh","orcid":null},"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":"Thi Thanh Binh Huynh","raw_affiliation_strings":["Hanoi University of Science and Technology, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3044,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.89460766,"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":"142","last_page":"149"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9190319180488586},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.8736387491226196},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.721896767616272},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.6555976867675781},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5995286107063293},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5907914042472839},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5546911954879761},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4839335083961487},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4615488350391388},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.43594232201576233},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.4162174463272095},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.40765810012817383},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3808264136314392},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.19833305478096008}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9190319180488586},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.8736387491226196},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.721896767616272},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.6555976867675781},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5995286107063293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5907914042472839},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5546911954879761},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4839335083961487},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4615488350391388},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.43594232201576233},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4162174463272095},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.40765810012817383},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3808264136314392},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.19833305478096008},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/taai.2015.7407102","is_oa":false,"landing_page_url":"https://doi.org/10.1109/taai.2015.7407102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W2567775","https://openalex.org/W42204479","https://openalex.org/W86594232","https://openalex.org/W96187628","https://openalex.org/W136908091","https://openalex.org/W1496687288","https://openalex.org/W1550474463","https://openalex.org/W1969205550","https://openalex.org/W1984836098","https://openalex.org/W1985225156","https://openalex.org/W1997293102","https://openalex.org/W2013046023","https://openalex.org/W2031012845","https://openalex.org/W2035802298","https://openalex.org/W2050817363","https://openalex.org/W2064661781","https://openalex.org/W2068330535","https://openalex.org/W2084359844","https://openalex.org/W2105047810","https://openalex.org/W2115314961","https://openalex.org/W2149263578","https://openalex.org/W2156819531","https://openalex.org/W2212811224","https://openalex.org/W2267334966","https://openalex.org/W2600961830","https://openalex.org/W3023322615","https://openalex.org/W3104258108","https://openalex.org/W4292240362","https://openalex.org/W6601738439","https://openalex.org/W6603536149","https://openalex.org/W6605546265","https://openalex.org/W6633512548","https://openalex.org/W6653665101","https://openalex.org/W6688568520"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W1595757466","https://openalex.org/W4200179302","https://openalex.org/W1645834615","https://openalex.org/W2766731260","https://openalex.org/W2980689483","https://openalex.org/W562960941","https://openalex.org/W3210931532","https://openalex.org/W2554682917","https://openalex.org/W2901016982"],"abstract_inverted_index":{"We":[0,56],"investigate":[1],"a":[2,50,72],"mechanism":[3],"of":[4,27,67,93,103],"combining":[5],"Genetic":[6,74],"Algorithms":[7],"(GA)":[8],"and":[9,34,63,76,98],"the":[10,45,65,68,84,95],"Variable":[11,77],"Neighborhood":[12,78],"Search":[13],"(VNS)":[14],"for":[15],"solving":[16],"Traveling":[17],"Salesman":[18],"Problem":[19],"(TSP).":[20],"This":[21],"combination":[22],"aims":[23],"to":[24,43],"take":[25],"advantage":[26],"GA's":[28],"strength":[29],"in":[30,38,91,101],"exploring":[31],"solution":[32,46,96],"space":[33],"VNS's":[35],"powerful":[36],"exploitation":[37],"that":[39,83],"space.":[40],"In":[41],"order":[42],"improve":[44],"quality,":[47],"we":[48],"propose":[49],"VNS":[51],"with":[52,71],"four":[53],"neighborhood":[54],"structures.":[55],"experimented":[57],"on":[58],"TSP":[59],"instances":[60],"from":[61],"TSP-Lib":[62],"compared":[64],"results":[66,81],"proposed":[69,85],"algorithm":[70,86],"hybrid":[73],"Algorithm":[75],"Search.":[79],"Experimental":[80],"show":[82],"is":[87],"better":[88],"than":[89],"once":[90],"terms":[92],"both":[94],"quality":[97],"running":[99],"times":[100],"majority":[102],"data":[104],"instances.":[105]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}