Improved calculation method of shortest path with cellular automata model

DOI10.1108/03684921211229578MaRDI QIDQ6105434zbMATH OpenFDO

Authors Min Wang, Yong-Sheng Qian, Xiaoping Guang

Publication date 9 June 2023

Published in Kybernetes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/03684921211229578

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Cellular automata (computational aspects) (68Q80) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50)

Cited in

(2)

• A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs
• An extended cellular automaton model for train traffic flow on the dedicated passenger lines

This page was built for publication: Improved calculation method of shortest path with cellular automata model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6105434)