Abstract
Experts working for railway operators still have to devote much time and effort to creating plans for rolling stock allocation. In this paper, we formulate the railway rolling stock allocation problem as a set partitioning multi-commodity flow (SPMCF) problem and we propose a search-based heuristic approach for SPMCF. We show that our approach can obtain an approximate solution near the optimum in shorter time than CPLEX for real-life problems. Since our approach deals with a wide variety of constraint expressions, it would be applicable for developing practical plans automatically for many railway operators. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Otsuki, T., Aisu, H., & Tanaka, T. (2010). A search-based approach to the railway rolling stock allocation problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6509 LNCS, pp. 131–143). https://doi.org/10.1007/978-3-642-17461-2_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
