On Using Learning Automata for Fast Graph Partitioning

Given a graph G, we intend to partition its nodes into two sets of equal size so as to minimize the sum of the cost of arcs having end-points in different sets. This problem, called the uniform Graph Partitioning Problem (GPP), is known to be NP-Complete. In this paper we propose the first reported learning-automaton based solution to the problem. We compare this new solution to various reported schemes such as the Kernighan-Lin's algorithm, and two excellent recent heuristic methods proposed by Rolland et. al. — an extended local search algorithm and a genetic algorithm. The current automaton-based algorithm outperforms all the other schemes. We believe that it is the fastest algorithm reported to date. Additionally, our solution can also be adapted for the GPP in which the edge costs are not constant but random variables whose distribution are unknown.

[1]  B. John Oommen,et al.  An adaptive learning solution to the keyboard optimization problem , 1991, IEEE Trans. Syst. Man Cybern..

[2]  Erik Rolland,et al.  Heuristic solution Procedures for the Graph Partitioning Problem , 1992, Computer Science and Operations Research.

[3]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[5]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[6]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[7]  M. Goodchild,et al.  Discrete space location-allocation solutions from genetic algorithms , 1986 .

[8]  Thomas A. Feo,et al.  A class of bounded approximation algorithms for graph partitioning , 1990, Networks.

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[11]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[12]  B. J. Oommen,et al.  Breaking Substitution Cyphers Using Stochastic Automata , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  B. John Oommen,et al.  Fast Learning Automaton-Based Image Examination and Retrieval , 1993, Comput. J..

[14]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[15]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[16]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[17]  Erik Rolland.  Abstract heuristic search methods for graph partitioning , 1991 .

[18]  B. John Oommen,et al.  Deterministic Learning Automata Solutions to the Equipartitioning Problem , 1988, IEEE Trans. Computers.

[19]  Erik Rolland,et al.  New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation , 1994, Comput. Oper. Res..

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .