A hybrid approach of GA and ACO for TSP

@article{Gong2004AHA,
  title={A hybrid approach of GA and ACO for TSP},
  author={Daoxiong Gong and Xiaogang Ruan},
  journal={Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788)},
  year={2004},
  volume={3},
  pages={2068-2072 Vol.3}
}
This paper proposed a hybrid approach of genetic algorithm (GA) and ant colony optimization (ACO) for the traveling salesman problem. In this approach, every chromosome of GA is at the same time an ant of ACO. Whenever GA performs the operation of crossover and mutation, the approach firstly computes the linkage strength between gene codes of parental chromosome(s) according to the pheromone matrix of ACO, and it then selects the crossover or mutation point(s) according to the linkage strength… CONTINUE READING
8 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Genetic algorithms for the travelling salesman problem : A review of representations and operators , ”

  • H. I. Bandelt, P. J. M. van Laarhaven, E. Pesch, H. P. Schwcfel, R. Manner
  • Arliciol hrelligence ‘ Rwiew
  • 1999

Colony System: A Cooperative Leaming Approach to the Traveling Salesman Problem,

  • Gambardella, “Ant
  • IEEE Tronsocrions on Evolutioionog Compulolion,
  • 1997

A New Approach to the Traveling Salesman Problem by Genetic Algorithms

  • C. Guan Homaifar, G. Liepins
  • 1994

Traveling Salesman Problem by Genetic Algorithms,

  • L.M.M. Dongo
  • Proc. 5lh Inl. ConJ On Genetic Algorirhm,
  • 1993

Similar Papers

Loading similar papers…