A genetic algorithm for finding a salesman’s route-Reference-Cited by-同舟云学术

A genetic algorithm for finding a salesman’s route

Published:2006-01 Issue:1 Volume:45 Page:89-95
ISSN:1064-2307
Container-title:Journal of Computer and Systems Sciences International
language:en
Short-container-title:J. Comput. Syst. Sci. Int.

Author:

Kureichik V. V.,Kureichik V. M.

Publisher

Pleiades Publishing Ltd

Subject

Applied Mathematics,Computer Networks and Communications,Computer Vision and Pattern Recognition,Information Systems,Theoretical Computer Science,Control and Systems Engineering,Software

Link

http://link.springer.com/content/pdf/10.1134/S1064230706010102.pdf

Reference15 articles.

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).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimizing customers’ waiting time in a vehicle routing problem with unit demands;Journal of Computer and Systems Sciences International;2015-11

2. New Imperialist Competitive Algorithm to solve the travelling salesman problem;International Journal of Computer Mathematics;2013-07

3. An interactive simulation and analysis software for solving TSP using Ant Colony Optimization algorithms;Advances in Engineering Software;2009-05