Abstract
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.
- Ahmed, Z. H. 2000. A sequential constructive sampling and related approaches to combinatorial optimization. Ph.D. thesis, Tezpur University, Assam, India.Google Scholar
- Ahmed, Z. H. 2010a. Genetic algorithm for the traveling salesman problem using sequential constructive crossover. Int. J. Biometrics Bioinformatics 3, 96--105.Google Scholar
- Ahmed, Z. H. 2010b. A hybrid sequential constructive sampling algorithm for the bottleneck traveling salesman problem. Int. J. Comput. Intell. Res. 6, 475--484.Google Scholar
- Ahmed, Z. H. 2010c. A lexisearch algorithm for the bottleneck traveling salesman problem. Int J. Comput. Sci. Secur. 3, 569--577.Google Scholar
- Ahmed, Z. H. 2011. A data-guided lexisearch algorithm for the bottleneck traveling salesman problem. Int. J. Oper. Res. 12, 1, 20--23.Google Scholar
Cross Ref
- Ahmed, Z. H., Pandit, S. N. N., and Borah, M. 1999. Genetic algorithms for the Min-Max travelling salesman problem. In Proceedings of the Annual Technical Session, Assam Science Society. 64--71.Google Scholar
- Burkard, R. E., Deinko, V. G., van Dal, R., van der Veen, J. A. A., and Woeginger, G. J. 1998. Well-solvable special cases of the traveling salesman problem: A survey. SIAM Rev. 40, 195--206. Google Scholar
Digital Library
- Carpaneto, G., Martello, S., and Toth, P. 1984. An algorithm for the bottleneck traveling salesman problems. Oper. Res. 32, 380--389.Google Scholar
Digital Library
- Deb, K. 1995. Optimization for Engineering Design: Algorithms and Examples. Prentice-Hall International, New Delhi, India.Google Scholar
- Gabovic, E., Ciz, A., and Jalas, A. 1971. The bottleneck traveling salesman problem. (Russian), Trudy Vy cisl. Centra Tartu. Gos. Univ. 22, 3--24.Google Scholar
- Garfinkel, R. S. and Gilbert, K. C. 1978. The bottleneck traveling salesman problem: Algorithms and probabilistic analysis. J. ACM 25, 435--448. Google Scholar
Digital Library
- Gilmore, P. C. and Gomory, R. E. 1964. Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Oper. Res. 12, 655--679.Google Scholar
Digital Library
- Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, New York. Google Scholar
Digital Library
- Johnson, D. S. 2006. Machine comparison site, http://public.research.att.com/~dsj/chtsp/speeds.html.Google Scholar
- 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.Google Scholar
- Kao, M.-Y. and Sanghi, M. 2009. An approximation algorithm for a bottleneck traveling salesman problem. J. Discrete Algorithms 7, 315--326. Google Scholar
Digital Library
- 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.Google Scholar
- Liu, F. and Zeng, G. 2009. Study of genetic algorithm with reinforcement to solve the TSP. Expert Syst. Appl. 36, 6995--7001. Google Scholar
Digital Library
- Parker, R. G. and Rardin, R. L 1984. Guaranteed performance heuristics for the bottleneck traveling salesman problem. Oper. Res. Lett. 2, 269--272. Google Scholar
Digital Library
- Philips, J. M. Punnen, A. P., and Kabadi, S. N 1998. A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph. Inf. Process. Lett. 67, 105--110. Google Scholar
Digital Library
- 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.Google Scholar
- Ramakrishnan, R., Sharma, P., and Punnen, A.P. 2009. An efficient heuristic algorithm for the bottleneck traveling salesman problem. Opsearch 46, 275--288.Google Scholar
Cross Ref
- TSPLIB. 1995. http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/.Google Scholar
- Vairaktarakis, G. L. 2003. On Gilmore-Gomorys open question for the bottleneck TSP. Operations Research Letters 31, 483--491. Google Scholar
Digital Library
- Wang, C.-X., Cui, D.-W., Wang, Z.-R., and Chen, D. 2005. A novel ant colony system based on minimum 1-tree and hybrid mutation for TSP. In Proceedings of the 2nd International Conference on Fuzzy Systems and Knowledge Discovery. Lecture Notes in Computer Science, vol. 3611, Springer, 1269--1278. Google Scholar
Digital Library
- Watson, J., Ross, C., Eisele, V., Denton, J., Bins, J., Guerra, C., Whitely, D., and Howe, A. 1998. The traveling salesrep problem, edge assembly crossover, and 2-opt. In Parallel Problem Solving from Nature V. Lecture Notes in Computer Science, vol. 1498, Springer, 823--832. Google Scholar
Digital Library
- 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.Google Scholar
Index Terms
A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem
Recommendations
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
This paper presents a variant of the asymmetric traveling salesman problem (ATSP) in which the traveling time between each pair of cities is represented by an interval of values (wherein the actual travel time is expected to lie) instead of a fixed (...
New Imperialist Competitive Algorithm to solve the travelling salesman problem
Imperialist Competitive Algorithm ICA, which is a new socio-politically motivated global search strategy, is one of the intelligent computational algorithms. ICA has always been used to solve continuous problems. In this paper, however, ICA is applied ...
Building Heuristics and Ensembles for the Travel Salesman Problem
Bio-inspired Systems and Applications: from Robotics to Ambient IntelligenceAbstractThe Travel Salesman Problem (TSP) is one of the most studied optimization problems due to its high difficulty and its practical interest. In some real-life applications of this problem the solution methods must be very efficient to deal with ...








Comments