Solving Traveling Salesman Problem Using Combinational Evolutionary Algorithm

@inproceedings{Bonyadi2007SolvingTS,
  title={Solving Traveling Salesman Problem Using Combinational Evolutionary Algorithm},
  author={Mohammad Reza Bonyadi and S. Mostafa Rahimi Azghadi and Hamed Shah-Hosseini},
  booktitle={AIAI},
  year={2007}
}
In this paper, we proposed a new method to solve TSP (Traveling Salesman Problem) based on evolutionary algorithms. This method can be used for related problems and we found out the new method can works properly in problems based on permutation. We compare our results by the previous algorithms and show that our algorithm needs less time in comparison with known algorithms and so efficient for such problems. 

References

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

Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm.

  • M. M. Eusuff, K. E. Lansey
  • Journal of Water Resources Planning and…
  • 2003
2 Excerpts

An Introduction to Genetic Algorithms, " A Bradford Book

  • Mitchell Melanie
  • 1999
2 Excerpts

The Selfish Gene

  • Richard Dawkins
  • 1989

Adaption in Natural and Artificial Systems, " University of Michigan Press

  • J. H. Holland
  • Ann Arbor (USA),
  • 1975
2 Excerpts

Similar Papers

Loading similar papers…