CoChat

Trajectory Optimization for High-Speed Trains via a Mixed Integer Linear Programming Approach

Cao, Yuan, Zhang, Zixuan, Cheng, Fanglin, Su, Shuai · 2022 · IEEE Transactions on Intelligent Transportation Systems
Cited by 216

The DOI matches its Crossref record.

Abstract

This paper proposes a trajectory optimization approach for high-speed trains to reduce traction energy consumption and increase riding comfort. Besides, the proposed approach can also achieve energy-saving effects by optimizing the operation time between stations. First, an optimization model is developed by defining the objective function as a trade-off function of the traction energy consumption and riding comfort. In addition to constraints in the classic optimal train control model, three new factors–the discrete throttle settings, neutral zones, and sectionalized tunnel resistance–are considered. Then, the model is discretized and turned into a multi-step decision optimization problem. All the nonlinear constraints are approximated using piecewise affine (PWA) functions, and the trajectory optimization problem is turned into a mixed integer linear programming (MILP) problem which can be solved by existing solvers CPLEX and YALMIP. Finally, some case studies with real-world data sets are conducted to present the effectiveness of the proposed approach. The simulation results are compared with the practical running data of trains, which shows that the proposed model and the optimization approach save energy and improve the riding comfort.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tits.2022.3155628

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Metadata

Authors
Cao, Y., Zhang, Z., Cheng, F., & Su, S.
Venue
IEEE Transactions on Intelligent Transportation Systems
Published
2022-10
Volume
23
Issue
10
Pages
17666-17676
ISSN
  • 1524-9050 (ISSN-L)
  • 1558-0016
OpenAlex
W4220835434
Cited by
216
References
0
FWCI
21.81
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: Trajectory Optimization for High-Speed Trains via a Mixed Integer Linear Programming Approach. https://app.cochat.ai/papers/10.1109/tits.2022.3155628
The paper
Cao, Y., Zhang, Z., Cheng, F., & Su, S. (2022). Trajectory Optimization for High-Speed Trains via a Mixed Integer Linear Programming Approach. IEEE Transactions on Intelligent Transportation Systems. https://doi.org/10.1109/tits.2022.3155628

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.