A genetic algorithm for finding a salesman's route

Journal of Computer and Systems Sciences International

Volumn 45, Issue 1, 2006, Pages 89-95

  Kureichik, V V ^a   Kureichik, V M ^a  

^a SOUTHERN FEDERAL UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; QUADRATIC PROGRAMMING; TRAVELING SALESMAN PROBLEM;

POLYNOMIAL TIME; QUADRATIC;

GENETIC ALGORITHMS;

EID: 33644774507     PISSN: 10642307     EISSN: None     Source Type: Journal    
DOI: 10.1134/S1064230706010102     Document Type: Article

References (15)

1. T. Kormen, I. Leizerson, and R. Rivest, Algorithms: Design and Analysis (MTsMO, Moscow, 2000) [in Russian].
2. M. I. Nechepurenko, V. K. Popkov, S. M. Mainagashev, et al., Algorithms and Programs for Solving Problems on Graphs and Networks (Nauka, Novosibirsk, 1990) [in Russian].
3. The Traveling Salesman Problem, Ed. by E. Lawler, J. Lenstra, and A. Kan (Wiley, New York, 1985).
4. J. Maconnell, Analysis of Algorithms. An Active Learning Approach (Johnes & Bartlett, London, 2001).
5. Handbook of Genetic Algorithms, Ed. by L. Davis (Van Nostrand Reinhold, New York, 1991).
6. J. Grefenstette, G. Gopal, and B. Rosmaita, in Proceedings of International Conference of Genetic Algorithms and Their Applications, Ed. by J. Grefenstette (Lawrence Erlbaum Associates, New Jersey, 1987), pp. 160-165.
7. I. Oliver, D. Smith, and J. R. Holland, "A Study of Permutation Crossover Operators on the Traveling Salesman Problem," in Proceedings of the Second International Conference on Genetic Algorithms, San Francisco, USA, 1997 (Morgan Kaufmann, San Francisco, 1997), pp. 224-230.
8. A. Tsuya and A. Tanaka, "A Fractal Representation of City Distribution Using Renormalization Coordinates," in Proceedings of International Symposium on Nonlinear Theory and Its Applications, Miyagi, Japan, 2001 (Institute of Electrical Communication, Nohoku University, 2001), pp. 319-320.
9. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, Massachusetts, 1989).
10. Genetic Algorithms and Evolution Strategy in Engineering and Computer Science, Ed. by D. Quagliarella (John Wiley, New York, 1998).
11. V. M. Kureichik and V. Miagkikh, "Some New Features in Genetic Solution of the TSP" in Proceedings of the 2nd International Conference, Plymouth, UK, 1996, pp. 294-296.
12. V. V. Emel'yanov, V. V. Kureichik, and V. M. Kureichik, The Theory and Experience of Evolutionary Modeling (Fizmatlit, Moscow, 2003) [in Russian].
13. C. I. Potts, T. D. Giddens, and S. B. Yadav, "The Development and Evaluation of an Improved Genetic Algorithm Based on Migration and Artificial Selection," IEEE Trans. Syst., Man Cybern. 24 (1), 73-86 (1994).
14. L. A. Gladkov, V. V. Kureichik, and V. M. Kureichik, Genetic Algorithms: Manual (RostIzdat, Rostov-on-Don, 2004) [in Russian].
15. A. Homaifar, S. Guan, and G. Liepins, "A New Approach on the Traveling Salesman Problem by Genetic Algorithms," in Proceedings of the 5th International Conference on Genetic Algorithms, San Mateo, USA, 1993 (Morgan Kaufmann, San Francisco, 1993), pp. 460-466.