{"id":"https://openalex.org/W2026911372","doi":"https://doi.org/10.1145/2406336.2406345","title":"A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem","display_name":"A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2026911372","doi":"https://doi.org/10.1145/2406336.2406345","mag":"2026911372"},"language":"en","primary_location":{"id":"doi:10.1145/2406336.2406345","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2406336.2406345","pdf_url":null,"source":{"id":"https://openalex.org/S136160450","display_name":"ACM Transactions on Embedded Computing Systems","issn_l":"1539-9087","issn":["1539-9087","1558-3465"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Embedded Computing 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/A5031191699","display_name":"Zakir Hussain Ahmed","orcid":"https://orcid.org/0000-0003-1938-6137"},"institutions":[{"id":"https://openalex.org/I40279923","display_name":"Islamic University","ror":"https://ror.org/04j1w0q97","country_code":"BD","type":"education","lineage":["https://openalex.org/I40279923"]}],"countries":["BD"],"is_corresponding":true,"raw_author_name":"Zakir Hussain Ahmed","raw_affiliation_strings":["Al-Imam Mohammad Ibn Saud Islamic University"],"affiliations":[{"raw_affiliation_string":"Al-Imam Mohammad Ibn Saud Islamic University","institution_ids":["https://openalex.org/I40279923"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031191699"],"corresponding_institution_ids":["https://openalex.org/I40279923"],"apc_list":null,"apc_paid":null,"fwci":4.809,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.94795749,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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.9994000196456909,"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.9987000226974487,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9973999857902527,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8114708662033081},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.7912436723709106},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7601420879364014},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7229312062263489},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6239129304885864},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6117706894874573},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5646708011627197},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5478441715240479},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5441757440567017},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5136539340019226},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.45854026079177856},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4413524866104126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2118082046508789},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13230255246162415}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8114708662033081},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7912436723709106},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7601420879364014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7229312062263489},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6239129304885864},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6117706894874573},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5646708011627197},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5478441715240479},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5441757440567017},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5136539340019226},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.45854026079177856},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4413524866104126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2118082046508789},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13230255246162415},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2406336.2406345","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2406336.2406345","pdf_url":null,"source":{"id":"https://openalex.org/S136160450","display_name":"ACM Transactions on Embedded Computing Systems","issn_l":"1539-9087","issn":["1539-9087","1558-3465"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Embedded Computing Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7300000190734863,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W145413376","https://openalex.org/W1507288960","https://openalex.org/W1561636111","https://openalex.org/W1639032689","https://openalex.org/W1832576148","https://openalex.org/W1985180289","https://openalex.org/W1997470528","https://openalex.org/W2013613968","https://openalex.org/W2015164669","https://openalex.org/W2044060832","https://openalex.org/W2057741299","https://openalex.org/W2060827745","https://openalex.org/W2117396900","https://openalex.org/W2135149549","https://openalex.org/W2140787410","https://openalex.org/W2149740490","https://openalex.org/W2170113397","https://openalex.org/W2267334966","https://openalex.org/W2278690112","https://openalex.org/W2283042507","https://openalex.org/W3023540311","https://openalex.org/W3119251296","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2358885468","https://openalex.org/W2979622390","https://openalex.org/W2363776630","https://openalex.org/W1578642111","https://openalex.org/W2356976268","https://openalex.org/W2126939445","https://openalex.org/W1998191041","https://openalex.org/W2318617794","https://openalex.org/W2026911372","https://openalex.org/W931968541"],"abstract_inverted_index":{"The":[0,43,63,85],"bottleneck":[1],"traveling":[2],"salesman":[3],"problem":[4,71,101],"is":[5],"to":[6,36,40,55,69,99],"find":[7],"a":[8,22],"Hamiltonian":[9],"circuit":[10],"that":[11],"minimizes":[12],"the":[13,41,56,70,89,100],"largest":[14],"cost":[15],"of":[16,18,65,91],"any":[17],"its":[19],"arcs":[20],"in":[21],"graph.":[23],"A":[24],"simple":[25,57],"genetic":[26],"algorithm":[27],"(GA)":[28],"using":[29],"sequential":[30],"constructive":[31],"crossover":[32],"has":[33,77],"been":[34,78],"developed":[35],"obtain":[37],"heuristic":[38,75],"solution":[39],"problem.":[42],"hybrid":[44,67,93],"GA":[45,58,68],"incorporates":[46],"2-opt":[47],"search,":[48],"another":[49],"proposed":[50],"local":[51],"search":[52],"and":[53],"immigration":[54],"for":[59,80,102],"obtaining":[60],"better":[61],"solution.":[62],"efficiency":[64],"our":[66,92],"against":[72],"two":[73],"existing":[74],"algorithms":[76],"examined":[79],"some":[81],"symmetric":[82],"TSPLIB":[83,104],"instances.":[84,105],"comparative":[86],"study":[87],"shows":[88],"effectiveness":[90],"algorithm.":[94],"Finally,":[95],"we":[96],"present":[97],"solutions":[98],"asymmetric":[103]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}