Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem

DOI10.1007/s10626-017-0251-zzbMath1386.93196OpenAlexW2725960764MaRDI QIDQ1686849

Peng Zhang

Publication date: 18 December 2017

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-017-0251-z

zbMATH Keywords

learning automatacellular algorithmadaptive Petri netgraph-based problemsvertex coloring (VC) problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Adaptive control/observation systems (93C40) Discrete event control/observation systems (93C65)

Related Items (2)

An Introduction to Learning Automata and Optimization ⋮ Cellular Automata, Learning Automata, and Cellular Learning Automata for Optimization

Cites Work

• The graph coloring problem: A neuronal network approach
• An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
• On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
• A hierarchical system of learning automata that can learn the globally optimal path
• Graph coloring for air traffic flow management
• On the analysis of Petri nets with static priorities
• An evolutionary approach for bandwidth multicoloring problems
• A NEW APPROACH TO THE VERTEX COLORING PROBLEM
• UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
• Locality in Distributed Graph Algorithms
• Understanding Petri Nets
• The Synthesis Problem
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem