Solving Traveling Salesman Problem Using Combinational Evolutionary Algorithm

@inproceedings{Bonyadi2007SolvingTS,
  title={Solving Traveling Salesman Problem Using Combinational Evolutionary Algorithm},
  author={M. R. Bonyadi and M. Azghadi and H. Shah-Hosseini},
  booktitle={AIAI},
  year={2007}
}
  • M. R. Bonyadi, M. Azghadi, H. Shah-Hosseini
  • Published in AIAI 2007
  • Computer Science
  • In this paper, we proposed a new method to solve TSP (Traveling Salesman Problem) based on evolutionary algorithms. [...] Key Method 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.Expand Abstract

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Travelling Salesman Problem
    • 39
    • PDF
    Population-Based Optimization Algorithms for Solving the Travelling Salesman Problem
    • 18
    • PDF
    A Particle Swarm Optimisation Approach to Graph Permutations
    • 5
    • Highly Influenced
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES
    Adaptation in natural and artificial systems
    • 35,592
    Artificial Intelligence : A Modern Approach
    • 23,601
    • PDF
    An Introduction to Genetic Algorithms.
    • 6,688
    • PDF
    An introduction to genetic algorithms
    • 4,855
    • PDF
    The Art of Computer Programming
    • 11,858
    An Introduction to Genetic Algorithms, " A Bradford Book
    • 1999
    Adaptation in Natural and Artificial Systems; University of Michigan Press
    • 2,780
    Artificial intelligence: a modem approach
    • 156