A cellular learning automata-based algorithm for solving the vertex coloring problem

Authors:
Javad Akbari Torkestani;Mohammad Reza Meybodi
Affiliations:
Department of Computer Engineering, Islamic Azad University, Arak Branch, Arak, Iran;Computer Engineering Department, Amirkabir University of Technology, Tehran, Iran and Institute for Studies in Theoretical Physics and Mathematics (IPM), School of Computer Science, Tehran, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 33
Cited 6

A hierarchical system of learning automata that can learn the globally optimal path

Information Sciences: an International Journal
Using tabu search techniques for graph coloring

Computing
Learning automata: an introduction

Learning automata: an introduction
Digital mechanics: an informational process based on reversible universal cellular automata

Physica D
Reversibility of 2D cellular automata is undecidable

Physica D
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
A robust simulated annealing based examination timetabling system

Computers and Operations Research
New methods to color the vertices of a graph

Communications of the ACM
Evolutionary graph colouring

Information Processing Letters
On Markov chains for randomly H-coloring a graph

Journal of Algorithms
Graph Coloring with Adaptive Evolutionary Algorithms

Journal of Heuristics
A New Genetic Local Search Algorithm for Graph Coloring

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
3-coloring in time O(1.3289n)

Journal of Algorithms
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Stochastic Local Search Algorithms for Graph Set T-colouring and Frequency Assignment

Constraints
A graph coloring heuristic using partial solutions and a reactive tabu scheme

Computers and Operations Research
An adaptive memory algorithm for the k-coloring problem

Discrete Applied Mathematics
Generalised graph colouring by a hybrid of local search and constraint programming

Discrete Applied Mathematics
Coloring graphs by iterated local search traversing feasible and infeasible solutions

Discrete Applied Mathematics
An improved ant colony optimisation heuristic for graph colouring

Discrete Applied Mathematics
An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables

Computers and Operations Research
Mobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: A learning automata approach

Computer Communications
Clustering the wireless Ad Hoc networks: A distributed learning automata approach

Journal of Parallel and Distributed Computing
Clustering the wireless Ad Hoc networks: A distributed learning automata approach

Journal of Parallel and Distributed Computing
An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata

Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient cluster-based CDMA/TDMA scheme for wireless mobile ad-hoc networks: A learning automata approach

Journal of Network and Computer Applications
A Learning Automata-Based Cognitive Radio for Clustered Wireless Ad-Hoc Networks

Journal of Network and Systems Management
Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs

Wireless Personal Communications: An International Journal
A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs

The Journal of Supercomputing
Finding Feasible Timetables Using Group-Based Operators

IEEE Transactions on Evolutionary Computation
Register allocation via coloring

Computer Languages
Enumerating maximal independent sets with applications to graph colouring

Operations Research Letters
On local search for the generalized graph coloring problem

Operations Research Letters

Learning automata-based algorithms for solving stochastic minimum spanning tree problem

Applied Soft Computing
A link stability-based multicast routing protocol for wireless mobile ad hoc networks

Journal of Network and Computer Applications
LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks

Computers and Electrical Engineering
A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems

Automatica (Journal of IFAC)
An adaptive learning automata-based ranking function discovery algorithm

Journal of Intelligent Information Systems
Adaptive cooperative particle swarm optimizer

Applied Intelligence

Quantified Score

Hi-index	12.05

Visualization

Abstract

Vertex coloring problem is a combinatorial optimization problem in which a color is assigned to each vertex of the graph such that no two adjacent vertices have the same color. Cellular learning automata (CLA) is an effective probabilistic learning model combining cellular automata and learning automata. Irregular cellular learning automata (ICLA) is a generalization of cellular learning automata in which the restriction of rectangular grid structure in traditional CLA is removed. In this paper, an ICLA-based algorithm is proposed for finding a near optimal solution of the vertex coloring problem. The proposed coloring algorithm is a fully distributed algorithm in which each vertex chooses its optimal color based solely on the colors selected by its adjacent vertices. The time complexity of the proposed algorithm is computed for finding a 11-@? optimal solution of the vertex coloring problem in an arbitrary graph. To show the superiority of our proposed algorithm over the existing methods, simulation experiments have been conducted. The obtained results show that the proposed algorithm outperforms the others in terms of the required number of colors and running time of algorithm.