Graph partitioning using learning automata

IEEE Transactions on Computers

Volumn 45, Issue 2, 1996, Pages 195-208

  Oommen, B John ^a,b   De St Croix, Edward V ^a  

^a IEEE

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Adaptive learning; Graph partitioning; Heuristic search; Learning automata

Indexed keywords

EID: 0000577436     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.485372     Document Type: Article

References (26)

1. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines. New York: John Wiley and Sons, 1989.
2. L.A. Cox, Jr., L. Davis, and Y. Qiu, "Dynamic anticipatory routing in circuit-switched telecommunications networks," Handbook of Genetic Algorithms, L. Davis, ed. New York: Van Nostrand Reinhold, 1991.
3. K.A. De Jong and W.M. Spears, "Using genetic algorithms to solve NP-complete problems," Proc. 3rd Int'l Conf. Genetic Algorithms, J.D. Schaffer, ed., George Mason University, 1989.
4. T.A. Feo and M. Khellaf, "A class of bounded approximation algorithms for graph partitioning," Networks, vol. 20, pp. 181-195, 1990.
5. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness. , New York: W. H. Freeman and Company, 1979.
6. M.R. Garey, D.S. Johnson, and L. Stockmeyer, "Some simplified NP-complete graph problems," Theor. Comput. Sci., vol. 1, pp. 237-267, 1976.
7. D.E. Goldberg, "Computer-aided pipeline operation using genetic algorithms and rule learning. Part 1: Genetic algorithms in pipeline optimization," Eng. with Computers, vol. 3, pp. 35-45, 1987.
8. D.E. Goldberg, Genetic Algorithms In Search, Optimization And Machine Learning. Reading, Mass.: Addison-Wesley Publishing Company, 1989.
9. B.L. Golden and C.C. Skiscim, "Using simulated annealing to solve routing and location problems," Naval Research Logistics Quarterly, vol. 33, pp. 261-279, 1986.
10. D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, "Optimization by simulated annealing: An experimental evaluation; Part 1, graph partitioning," Operations Research, vol. 37, no. 6, 1989.
11. B.W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs." The Bell Systems Tech. J., vol. 49, pp. 291-307, 1970.
12. M. Laguna, T.A. Feo, and H.C. Elrod, "A greedy adaptive search procedure for the two-paartition problem," Operations Research, vol. 42, pp. 677-687, 1994.
13. G.E. Liepins and M.R. Hilliard, "Genetic algorithms: Foundations and applications," Annals of Operations Research, vol. 21, pp. 31-58, 1989.
14. N.J. Nilsson, Principles of Artificial Intelligence. Palo Alto, Calif.: Tioga Publishing, 1980.
15. K.S. Narendra and M.A.L. Thathachar, Learning Automata: An Introduction, Englewood Cliffs, N.J.: Prentice-Hall, Inc., 1989.
16. B.J. Oommen and T. De St. Croix, "String taxonomy using object migrating automata," to appear IEEE Trans. Systems, Man, and Cybernetics.
17. B.J. Oommen and C. Fothergill, "Fast learning automaton-based image examination and retrieval," The Computer J., vol. 36, no. 6, pp. 542-553, 1993.
18. B.J. Oommen and D.C.Y. Ma, "Deterministic learning automata solutions to the equipartitioning problem," IEEE Trans Computers, vol. 37, pp. 2-13, 1988.
19. B.J. Oommen, R.S. Valiveti, and J. Zgierski, "An adaptive learning solution to the keyboard optimization problem," IEEE Trans. Systems, Man, and Cybernetics, vol. 22, pp. 1,233-1243, Sept./Oct. 1992.
20. B.J. Oommen and J. Zgierski, "A learning automaton solulion to breaking substitution ciphers," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, pp. 185-192, Feb. 1993.
21. H. Pirkul and E. Rolland, "New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation." Computers and Operations Research, Oct. 1994.
22. E. Rolland, "Abstract heuristic search methods for graph partitioning," PhD dissertation, The Ohio State Univ., Columbus, 1991.
23. E. Rolland and H. Pirkul, "Heuristic solution procedures for the graph partitioning problem," Proc. 1992 ORSA-CSTS Conf. Computer Science and Operations Research: New Developments in Their Interfaces, Williamsburg, pp. 475-490, 1992.
24. B. Rolland, H. Pirkul, and F. Glover, "Tabu search for graph partitioning," to appear Annals of Operations Research (Special Issue on Meta-Heuristics).
25. M.L. Tsetlin, "Automaton theory and the modeling of biological systems. New York and London: Academic, 1973.
26. C.T. Yu, M.D. Siu, D. Lam, and T. Tai, "Adaptive clustering schemes: General framework," Proc. IEEE COMPSAC Conf., pp. 81-89, 1981.