Genetic algorithm for determining multiple routes and its applications

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn 6, Issue , 1999, Pages

  Inagaki, Jun ^a   Haseyama, Miki ^a   Kitajima, Hideo ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DIJKSTRA ALGORITHM; MULTIPLE ROUTES;

GENETIC ALGORITHMS; PROBLEM SOLVING;

CIRCUIT THEORY;

EID: 17444442861     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (6)

1. E.F. Moore. "The shortest path through a maze." Proc. Int. Symp. Switching Theory. Part 11. pp. 285-292. 1959.
2. R.E. Tarjan. "Depth-first search and linear graph algorithms." SIAM J. Comput. 1. pp. 146-160. 1972.
3. A. Reinefeld and I-. Schnecke. "Work-load balancing in highly parallel depth-first search." Proc. Scalable High Performance Computing Conf. pp. 773-780. 1994.
4. E.W. Dijkstra. "A note of two problems in connection with graphs." Numerische Mathematik. vol.1. pp. 269-271. 1959.
5. D.E. Goldberg. "Genetic Algorithms in Search. Optimization. and Machine Learning." -Addison-Kesley. 1989.
6. J.J. Grefenstette. R. Gopal. B. Rosmaita. and D. Van Gucht. "Genetic Algorithm for the Traveling Salesman Problem." Proceeding of the 1st International Conference on Genetic Algorithm and Their -Applications. 1983