A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem

@article{Ahmed2013AHG,
  title={A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem},
  author={Zakir Hussain Ahmed},
  journal={ACM Trans. Embedded Comput. Syst.},
  year={2013},
  volume={12},
  pages={9:1-9:10}
}
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… CONTINUE READING
2
Twitter Mentions

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Genetic algorithm for the traveling salesman problem using sequential constructive crossover

Z. H. Ahmed
  • Int. J. Biometrics Bioinformatics 3, 96–105.
  • 2010
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL