Solving the traveling salesman problem using genetic algorithms with the new evaluation function

@inproceedings{Tabatabaee2015SolvingTT,
  title={Solving the traveling salesman problem using genetic algorithms with the new evaluation function},
  author={Hamid Tabatabaee and Hosian Salami and Nafiseh Sedaghat and Naghmeh Sharif},
  year={2015}
}
Traveling salesman problem is of the known and classical problems at Research in Operations. Many scientific activities can be solved as traveling salesman problem. Existing methods for solving hard problems (such as the traveling salesman problem) consists of a large number of variables and constraints which reduces their practical efficiency in solving problems with the original size. In recent decades, the use of heuristic and meta-heuristic algorithms such as genetic algorithms is… CONTINUE READING

References

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

A Survey on Hybridizing Genetic Algorithm with Dynamic Programming for Solving the Traveling Salesman Problem

P. D. Thanh, H.T.T. Binh, B. T. Lam
  • Trends in Innovative Computing,
  • 2013
VIEW 1 EXCERPT

Paputungan, A Hybrid Optimization Algorithm Based On Genetic Algorithm And Ant Colony Optimization, International

I.V.Z. Zukhri
  • Journal of Artificial Intelligence & Applications (IJAIA),
  • 2013
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…