Solving the rural postman problem using a genetic algorithm with a graph transformation

Proceedings of the ACM Symposium on Applied Computing

Volumn 02-February-1998, Issue , 1998, Pages 356-360

  Kang, Myung Ju ^a   Han, Chi Geun ^a  

^a Kyung Hee University   (South Korea)

Author keywords

Genetic algorithm; Hamiltonian graph; Rural postman problem

Indexed keywords

CHROMOSOMES; GRAPH THEORY; HAMILTONIANS;

CHROMOSOME STRUCTURE; GRAPH G; GRAPH TRANSFORMATION; HAMILTONIAN GRAPH; MINIMUM COST; RURAL POSTMAN PROBLEM; SOLUTION SPACE;

GENETIC ALGORITHMS;

EID: 85002235370     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/330560.330839     Document Type: Conference Paper

References (11)

1. Bondy, J. A. and Murty, U. S. R., 1977, Graph Theory with Applications, Macmillan Press Ltd.
2. Fausett, L., 1994, Fundamentals of Neural Networks Architectures, Algorithms, and Applications, Prentice Hall.
3. Freeman, J. A. and Skapura, D. M., 1979, Neurol Networks Algorithms, Applications, and Programming Techniques, Addison-Wesley.
4. Garey, M. R. and Johnson, D. S., 1979, Computers and Intractability-A Guide to the Theory of NP-Completeness, p. 213, FREEMAN.
5. Goldberg, D. E., 1989, Genetic Algorithm in Search, Optimization e Machine Learning, Addison-Wesley.
6. Goldberg, D. E. and Lingle, R., 1985, Alleles, loci, and the Traveling Salesman Problem., Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp. 154-149.
7. Greening, D. R., 1995, Simulated Annealing with Errors, PhD. paper, University of California.
8. Ladd, S. R., 1995, Genetic Algorithms in C++, M&T Books.
9. Lee, Y. H., Kang, M. J. and Han, C. G., 1996, A Genetic Algorithm for Obtaining a Near-Optimal Solution in Rural Postman Problem, Journal of KISS, Vol. 23, No. 11, PP. 1118-1125.
10. Lenstra, J. K. and Rinnooy Kan, A. H. G., 1976, On General Routing Problems., Networks, Vol. 6, pp. 273-280.
11. Michalewicz Z., 1994, Genetic Algorithms + Data Structures = Evolution Programs, Second Edition, Springer-Verlag.