A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem

Authors:
Zakir Hussain Ahmed
Affiliations:
Al-Imam Mohammad Ibn Saud Islamic University
Venue:
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
Year:
2013

Citing 10
Cited 0

A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph

Information Processing Letters
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

SIAM Review
The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis

Journal of the ACM (JACM)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Study of genetic algorithm with reinforcement learning to solve the TSP

Expert Systems with Applications: An International Journal
An approximation algorithm for a bottleneck traveling salesman problem

Journal of Discrete Algorithms
A novel ant colony system based on minimum 1-tree and hybrid mutation for TSP

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Guaranteed performance heuristics for the bottleneck travelling salesman problem

Operations Research Letters
On Gilmore-Gomory's open question for the bottleneck TSP

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.