Genetic algorithms and the Traveling Salesman Problem

@inproceedings{Keresztury2017GeneticAA,
  title={Genetic algorithms and the Traveling Salesman Problem},
  author={Bence Keresztury and Tam{\'a}s Kir{\'a}ly},
  year={2017}
}
My thesis is about the nature of evolutionary algorithms and how they can be applied to a well-known optimization problem. A brief introduction about the elements of evolutionary algorithm is given. I further investigated the Traveling Salesman Problem (TSP), a popular problem in combinatorial optimization. Some of the widely used methods for solving TSP including tour construction and tour improvement heuristics are presented. I also discuss one possible generalization of the original problem… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 12 CITATIONS

Using data mules for sensor network data recovery

VIEW 2 EXCERPTS
CITES METHODS & RESULTS

Application of Web Scraping and Google API service to optimize convenience stores' distribution

  • 2015 17th International Conference on Advanced Communication Technology (ICACT)
  • 2015
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 40 REFERENCES

Optimalizálás evolúciós számításokkal

I. Borgulya
  • Typotex,
  • 2012

A new efficient transformation of the generalized traveling salesman problem into traveling salesman problem

A. Behzad, M. Modarres
  • Proceedings of the 15th International Conference of Systems Engineering, pages 6–8,
  • 2002
VIEW 1 EXCERPT