{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:52:31Z","timestamp":1760597551652,"version":"3.41.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2013,1]]},"abstract":"<jats:p>The bottleneck traveling salesman problem is to find a Hamiltonian circuit that minimizes the largest cost of any of its arcs in a graph. A simple genetic algorithm (GA) using sequential constructive crossover has been developed to obtain heuristic solution to the problem. The hybrid GA incorporates 2-opt search, another proposed local search and immigration to the simple GA for obtaining better solution. The efficiency of our hybrid GA to the problem against two existing heuristic algorithms has been examined for some symmetric TSPLIB instances. The comparative study shows the effectiveness of our hybrid algorithm. Finally, we present solutions to the problem for asymmetric TSPLIB instances.<\/jats:p>","DOI":"10.1145\/2406336.2406345","type":"journal-article","created":{"date-parts":[[2013,1,29]],"date-time":"2013-01-29T16:20:55Z","timestamp":1359476455000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem"],"prefix":"10.1145","volume":"12","author":[{"given":"Zakir Hussain","family":"Ahmed","sequence":"first","affiliation":[{"name":"Al-Imam Mohammad Ibn Saud Islamic University"}]}],"member":"320","published-online":{"date-parts":[[2013,1]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Ahmed Z. H. 2000. A sequential constructive sampling and related approaches to combinatorial optimization. Ph.D. thesis Tezpur University Assam India.  Ahmed Z. H. 2000. A sequential constructive sampling and related approaches to combinatorial optimization. Ph.D. thesis Tezpur University Assam India."},{"key":"e_1_2_1_2_1","first-page":"96","article-title":"Genetic algorithm for the traveling salesman problem using sequential constructive crossover","volume":"3","author":"Ahmed Z. H.","year":"2010","journal-title":"Int. J. Biometrics Bioinformatics"},{"key":"e_1_2_1_3_1","first-page":"475","article-title":"A hybrid sequential constructive sampling algorithm for the bottleneck traveling salesman problem","volume":"6","author":"Ahmed Z. H.","year":"2010","journal-title":"Int. J. Comput. Intell. Res."},{"key":"e_1_2_1_4_1","first-page":"569","article-title":"A lexisearch algorithm for the bottleneck traveling salesman problem","volume":"3","author":"Ahmed Z. H.","year":"2010","journal-title":"Int J. Comput. Sci. Secur."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJOR.2011.041857"},{"volume-title":"Proceedings of the Annual Technical Session, Assam Science Society. 64--71","author":"Ahmed Z. H.","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144596297514"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.2.380"},{"key":"e_1_2_1_9_1","unstructured":"Deb K. 1995. Optimization for Engineering Design: Algorithms and Examples. Prentice-Hall International New Delhi India.  Deb K. 1995. Optimization for Engineering Design: Algorithms and Examples . Prentice-Hall International New Delhi India."},{"key":"e_1_2_1_10_1","first-page":"3","article-title":"The bottleneck traveling salesman problem. (Russian), Trudy Vy cisl. Centra Tartu","volume":"22","author":"Gabovic E.","year":"1971","journal-title":"Gos. Univ."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322086"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.5.655"},{"key":"e_1_2_1_13_1","unstructured":"Goldberg D. E. 1989. Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley New York.   Goldberg D. E. 1989. Genetic Algorithms in Search Optimization and Machine Learning . Addison-Wesley New York."},{"key":"e_1_2_1_14_1","unstructured":"Johnson D. S. 2006. Machine comparison site http:\/\/public.research.att.com\/~dsj\/chtsp\/speeds.html.  Johnson D. S. 2006. Machine comparison site http:\/\/public.research.att.com\/~dsj\/chtsp\/speeds.html."},{"key":"e_1_2_1_15_1","unstructured":"Kabadi S. and Punnen A. P. 2002. The bottleneck TSP. In The Traveling Salesman Problem and Its Variants G. Gutin and A. P. Punnen Eds. Kluwer Academic Publishers Secaucus NJ.  Kabadi S. and Punnen A. P. 2002. The bottleneck TSP. In The Traveling Salesman Problem and Its Variants G. Gutin and A. P. Punnen Eds. Kluwer Academic Publishers Secaucus NJ."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.11.007"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Li L. and Zhang Y. 2007. An improved genetic algorithm for the traveling salesman problem. In Communications in Computer and Information Science 2 D.-S. Huang L. Heutte and M. Loog Eds. Springer 208--216.  Li L. and Zhang Y. 2007. An improved genetic algorithm for the traveling salesman problem. In Communications in Computer and Information Science 2 D.-S. Huang L. Heutte and M. Loog Eds. Springer 208--216.","DOI":"10.1007\/978-3-540-74282-1_24"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.08.026"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(84)90077-4"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00094-5"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Radcliffe N. J. and Surry P. D. 1995. Fitness variance of formae and performance prediction. In Foundations of Genetic Algorithms 3 D. Whitely and M. D. Vose Eds. Morgan Kaufmann San Mateo CA 51--72.  Radcliffe N. J. and Surry P. D. 1995. Fitness variance of formae and performance prediction. In Foundations of Genetic Algorithms 3 D. Whitely and M. D. Vose Eds. Morgan Kaufmann San Mateo CA 51--72.","DOI":"10.1016\/B978-1-55860-356-1.50007-8"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12597-009-0018-x"},{"key":"e_1_2_1_23_1","unstructured":"TSPLIB. 1995. http:\/\/www.iwr.uni-heidelberg.de\/iwr\/comopt\/software\/TSPLIB95\/.  TSPLIB. 1995. http:\/\/www.iwr.uni-heidelberg.de\/iwr\/comopt\/software\/TSPLIB95\/."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00050-6"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539117_168"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645824.668596"},{"key":"e_1_2_1_27_1","unstructured":"Whitely D. Starkweather T. and Shaner D. 1991. The traveling salesman and sequence scheduling: quality solutions using genetic edge recombination. In Handbook of Genetic Algorithms L. Davis Ed. Van Nostrand Reinhold New York 350--372.  Whitely D. Starkweather T. and Shaner D. 1991. The traveling salesman and sequence scheduling: quality solutions using genetic edge recombination. In Handbook of Genetic Algorithms L. Davis Ed. Van Nostrand Reinhold New York 350--372."}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2406336.2406345","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2406336.2406345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:13:55Z","timestamp":1750277635000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2406336.2406345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["10.1145\/2406336.2406345"],"URL":"https:\/\/doi.org\/10.1145\/2406336.2406345","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2013,1]]},"assertion":[{"value":"2010-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}