A search-based approach to the railway rolling stock allocation problem

Authors:
Tomoshi Otsuki;Hideyuki Aisu;Toshiaki Tanaka
Affiliations:
Toshiba Corporation, Saiwai-ku, Kawasaki, Japan;Toshiba Corporation, Saiwai-ku, Kawasaki, Japan;Toshiba Corporation, Saiwai-ku, Kawasaki, Japan
Venue:
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Year:
2010

Citing 8
Cited 0

A Survey of Optimization Models for Train Routing and Scheduling

Transportation Science
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem

Transportation Science
Airline Crew Recovery

Transportation Science
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Allocation of Railway Rolling Stock for Passenger Trains

Transportation Science
Efficient Circulation of Railway Rolling Stock

Transportation Science
New approaches for solving the block-to-train assignment problem

Networks - Special Issue In Memory of Stefano Pallottino
On the Complexity of Train Assignment Problems

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

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.