| Summary: | Each loop in a multi-loop rail network consists of two segments, both of which have roughly the same conditions and mileage and are approximately symmetrical. This paper is devoted to optimizing the paths of trains formed at the loading area in a multi-loop rail network. To attain this goal, three different situations are analyzed, and two models are proposed for networks with adequate and inadequate capabilities. Computational experiments are also carried out using the commercial software Lingo, with the branch and bound algorithm. The results show that the models can achieve the same solution with different solution times. To solve the problem of path selection for large-scale train flows, a genetic algorithm is also designed and proves to perform well in a set of computational experiments.
|
|---|
