Application of Genetic Algorithms to the Train Scheduling Problem

Planning and scheduling problems belong to the category of NP-complete problems, which means that the time to solve such a problem depends polynomially on its dimensionality. Genetic algorithms are a universal tool for solving various problems, including optimization problems. This paper presents the application of the classical genetic algorithm to solve the problem of scheduling railway traffic, and gives an example of the algorithm's work.