Locomotive assignment on railway corridor: Problem and algorithms
Year: 2025
Type: article
Abstract: We consider how to assign locomotives to satisfy the freight demand on railway corridor. By learning, we find that locomotive assignment on the corridor can be transformed into a combinatorial optimization problem, namely Minimum Path Partition Problem. This can be seen as a sub-problem of the Minimum Path Factor Problem. Two methods are presented for the Minimum Path Partition Problem: the first method, based on the approach to the Minimum Path Factor Problem, runs in time O(n2.5); the second method, taking advantage of the characteristic of the time-space network, is faster, and its running time is O(n), where n is the number of vertices in the time-space network of demand.
Authors: Rui Guan, Dongyue Liang, Weihua Yang
Institution: Taiyuan University of Technology
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7117305186
FWCI:
Cites:
Cited by:
Related to: