The Genetic Algorithms for the Carrying Capacity of Parallel
Train Working Graph on Single Railway Lines

YAN Yu-song

Volume 13 Issue 3

Jun. 2000

Turn off MathJax

Article Contents

Journal of Southwest Jiaotong University > 2000 > 13(3): 277-279.

YAN Yu-song. The Genetic Algorithms for the Carrying Capacity of ParallelTrain Working Graph on Single Railway Lines[J]. Journal of Southwest Jiaotong University, 2000, 13(3): 277-279.

Citation:

YAN Yu-song. The Genetic Algorithms for the Carrying Capacity of Parallel Train Working Graph on Single Railway Lines[J]. Journal of Southwest Jiaotong University, 2000, 13(3): 277-279.

YAN Yu-song. The Genetic Algorithms for the Carrying Capacity of ParallelTrain Working Graph on Single Railway Lines[J]. Journal of Southwest Jiaotong University, 2000, 13(3): 277-279.

Citation:

YAN Yu-song. The Genetic Algorithms for the Carrying Capacity of Parallel Train Working Graph on Single Railway Lines[J]. Journal of Southwest Jiaotong University, 2000, 13(3): 277-279.

PDF( 0 KB)

The Genetic Algorithms for the Carrying Capacity of Parallel Train Working Graph on Single Railway Lines

YAN Yu-song

Publish Date: 25 Jun 2000

Abstract

Abstract

In this paper, a genetic algorithm based on the integer programming model is given, which can be used to calculate the carrying capacityof parallel trainworkinggraphon single railway lines. Thisgenetic algorithm is proved to be possible and useful for the problem of calculating the carrying capacity.
- railway,
- single lines,
- train graphs,
- carrying capacity,
- genetic algorithms