The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Optimising train movements through coastcontrolusing genetic algorithms
Abstract
A genetic algorithm (GA) is proposed to optimise train movements using appropriate coast control that can be integrated within automatic train operation (ATO) systems. The coast control output for a train changes with the interstation distances and gradient profiles, and the current operating conditions of the mass rapid transit (MRT) system, namely, (i) train schedules, (ii) expected passenger loads and (iii) expected track voltages. The algorithm generates an optimum coast control based on evaluation of the punctuality, riding comfort and energy consumption. Before the train sets off to the designated station, a coast control table is generated that will be referenced by the train at runtime for deciding when to initiate coasting or resume motoring control. Each coast control table is encoded into variable length chromosomes with each gene representing the relative position between stations where coasting should be initiated or terminated. Each generation is evolved from mating of the paired equal-length chromosomes with possibilities of crossover, mutations, gene duplications and gene deletions. The key feature of this method is that it has a solid mathematical foundation. Effectively, the implementation provides good, credible and reasonably fast solutions for this variable dimensional and multiobjective optimisation problem. The algorithm has the potentials for on-line implementation for producing the coast control lookup table for each interstation run before the train sets off. The results, although preliminary, suggest that the method is promising.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
(2021) · IEEE Electrical Insulation Magazine · doi:10.1109/mei.2021.9514644 · Cited by 192
Cited by
Evolutionary algorithms in control systems engineering: a survey
Fleming, P. J., & Purshouse, R. C. (2002) · Control Engineering Practice · doi:10.1016/s0967-0661(02)00081-3 · Cited by 619
Multi-objective meta-heuristics: An overview of the current state-of-the-art
Jones, D. F., Mirrazavi, S. K., & Tamiz, M. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00123-0 · Cited by 567
A Subway Train Timetable Optimization Approach Based on Energy-Efficient Operation Strategy
Su, S., Li, X., Tang, T., & Gao, Z. (2013) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2013.2244885 · Cited by 374
Single-Train Trajectory Optimization
Lu, S., Hillmansen, S., Ho, T. K., & Roberts, C. (2013) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2012.2234118 · Cited by 334
Bio-Inspired Speed Curve Optimization and Sliding Mode Tracking Control for Subway Trains
Cao, Y., Wang, Z.-C., Liu, F., Li, P., & Xie, G. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2914936 · Cited by 264
Metadata
- Authors
- Chang, C. S., & Sim, S. S.
- Venue
- IEE Proceedings - Electric Power Applications
- Published
- 1997-01-31
- Volume
- 144
- Issue
- 1
- Pages
- 65-73
- ISSN
- 1350-2352 (ISSN-L)
- 1359-7043
- OpenAlex
- W2065474320
- Cited by
- 327
- References
- 2
- FWCI
- 1.80
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimising train movements through coastcontrolusing genetic algorithms. https://app.cochat.ai/papers/10.1049/ip-epa:19970797
- The paper
- Chang, C. S., & Sim, S. S. (1997). Optimising train movements through coastcontrolusing genetic algorithms. IEE Proceedings - Electric Power Applications. https://doi.org/10.1049/ip-epa%3A19970797
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.