Nov. 5, 2023, 6:42 a.m. | Feiyu Yang

cs.LG updates on arXiv.org arxiv.org

The single-track railway train timetabling problem (TTP) is an important and
complex problem. This article proposes an integrated Monte Carlo Tree Search
(MCTS) computing framework that combines heuristic methods, unsupervised
learning methods, and supervised learning methods for solving TTP in discrete
action spaces. This article first describes the mathematical model and
simulation system dynamics of TTP, analyzes the characteristics of the solution
from the perspective of MCTS, and proposes some heuristic methods to improve
MCTS. This article considers these methods …

article arxiv computing framework railway search spaces supervised learning train tree unsupervised unsupervised learning

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne