Application of Multiple-Population Genetic Algorithm in Optimizing the Train-Set Circulation Plan Problem
The train-set circulation plan problem (TCPP) belongs to the rolling stock scheduling (RSS) problem and is similar to the aircraft routing problem (ARP) in airline operations and the vehicle routing problem (VRP) in the logistics field. However, TCPP involves additional complexity due to the mainten...
Saved in:
| Main Authors: | Yu Zhou, Leishan Zhou, Yun Wang, Zhuo Yang, Jiawei Wu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2017/3717654 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Application of genetic algorithm for the set-covering problem solution
by: Igor S. Konovalov, et al.
Published: (2016-09-01) -
DETERMINING THE SIZE OF THE POPULATION OF THE GENETIC ALGORITHM FOR THE PROBLEMS OF DISCRETE OPTIMIZATION IN CAD
by: V. V. Frolov
Published: (2018-10-01) -
Genetic algorithm efficiency improvement in the course of set cover problem solution
by: I. S. Konovalov, et al.
Published: (2019-12-01) -
An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem
by: Luoyi Shi, et al.
Published: (2014-01-01) -
An adaptive genetic algorithm with double populations for solving traveling salesman problems
by: Taishan Yan, et al.
Published: (2025-07-01)