Finding rural postman tours

Proceedings of the ACM Symposium on Applied Computing

Volumn 02-February-1998, Issue , 1998, Pages 318-326

  Cook, Clarissa ^a   Schoenefeld, Dale A ^a   Wainwright, Roger L ^a  

^a UNIVERSITY OF TULSA   (United States)

Author keywords

Combinatorial optimization; Genetic algorithms; Graph theory; Routing; Rural postman tours

Indexed keywords

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; GRAPH THEORY;

NEAR-OPTIMAL SOLUTIONS; ROUTING; RURAL POSTMAN PROBLEM;

COMPUTATION THEORY;

EID: 85002263369     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/330560.330832     Document Type: Conference Paper

References (17)

1. M. J. Alexander and G. Robins. "Now Performance-Driven FPGA Routing Algorithms," Proceedings of ACM/SIGDA Design Automation Conference, San Francisco, June, 1995.
2. J. Blanton and R. Wainwright, "Multiple Vehicle routing with time and capacity constraints using genetic algorithms," S. Forrest (ed.), Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 452-459, Morgan Kaufman, 1993.
3. A. Corcoran and R. Wainwright, "Using LibGA to Develop Genetic Algorithms for Solving Coinbinatorial Optimization Problems," Practical Handbook of Genetic Algorithms, Applications, Volume 1, Editor Lance Chambers, CRC, 1995.
4. L. Davis, editor, Handbook of Genette Algorithms, Van Nostrand Reinhold, 1991.
5. J. Edmonds and E. L. Johnson, "Matching: A Well Solved Class of Integer Linear Programs," Combinatorial Structures and their Applications. Gordon and Breach, New York, pages 89-92, 1970.
6. J. Edmonds and E. L. Johnson, "Matching, Euler Tours, and the Chinese Postman," Mathematical Programming 5, pages 88-124, 1973.
7. J. R. Evans and E. Minieka, Optimization Algorithms for Networks and Graphs, Second Edition, Dekker, 1992.
8. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, 1979.
9. D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.
10. Kenneth E. Kinnear, Advances in Genetic Programming, The MIT Press, 1994.
11. John R. Koza, Genetic Programming, The MIT Press, 1992.
12. John R. Koza, Genetic Programming II, The MIT Press. 1994.
13. C. L. Liu, Elements of Discrete Mathematics, Second Edition, McGraw Hill, 1985.
14. J. K. Lenstra and A. H. G. Rinnooy Kan, "On general routing problems," Networks 6. pages 273-280. 1976.
15. C. S. Orloff, "A Fundamental Problem in Vehicle Routing," Networks 4,: pages 35-64, 1974
16. G. Rawlins, editor, Foundations of Genetic Algorithms, Morgan Kaufman, 1991.
17. C. H. Papadimitriou, "On the Complexity of Edge Traversing," Journal of the Association of Computing Machinery 23, pages 544-554, 1976