Genetic Algorithm for Solution of the Traveling Salesman Problem with New Features against Premature Convergence

@inproceedings{Kureichick1996GeneticAF,
  title={Genetic Algorithm for Solution of the Traveling Salesman Problem with New Features against Premature Convergence},
  author={Victor M. Kureichick and Victor V. Miagkikh and Alexander P. Topchy},
  year={1996}
}
Genetic Algorithms are finding increasing number of applications in a variety of problems in a whole spectrum of disciplines. This paper describes a genetic algorithm with novel features against premature convergence successfully applied to solution of the Traveling Salesman Problem (TSP). Authors practiced modified version of Greedy Crossover, and operators brushing the population helping to escape from local minima. As the results, the frequency of finding the optimal solution was improved… CONTINUE READING

References

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

Genetic algorithms for the traveling salesman problem

  • J Grefenstette
  • Proc. Intern. Conf. of Genetic Algorithms and…
  • 1985
Highly Influential
6 Excerpts

A Genetic Algorithm Approach to Compaction, Bin Packing, and Nesting Problems’, Tech. report #940702. Case center for computer-aided engineering and manufacturing

  • E Goodman
  • 1994
1 Excerpt

The Effect of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Proble

  • P Jog
  • Proc. of the Third International Conf. on Genetic…
  • 1989
2 Excerpts

A study of permutation crossover operators on the traveling salesman problem

  • I Oliver
  • Proc. of the Second Int. Conf. on Genetic…
  • 1987
3 Excerpts

Greedy Genetics

  • G Leipins
  • Proc. of the Second International Conf. on…
  • 1987
1 Excerpt

Similar Papers

Loading similar papers…