2023
DOI: 10.1109/tvt.2023.3262345
|View full text |Cite
|
Sign up to set email alerts
|

Eco-Driving for Metro Trains: A Computationally Efficient Approach Using Convex Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 44 publications
0
2
0
Order By: Relevance
“…The least amount of remaining energy of the battery system is at the final instance. Consequently, if an optimal value of 𝜆 * e can be found to satisfy the constraint (25h) at the final instance, the dynamics (24) and constraint (25h) can be removed from the optimization problem by adding the product of 𝜆 * e and the battery force 22), ( 23), (25c ), (25d ), (25e), (25 f ), (25g), (28b)…”
Section: Analysis Based On Pmp Principlementioning
confidence: 99%
See 1 more Smart Citation
“…The least amount of remaining energy of the battery system is at the final instance. Consequently, if an optimal value of 𝜆 * e can be found to satisfy the constraint (25h) at the final instance, the dynamics (24) and constraint (25h) can be removed from the optimization problem by adding the product of 𝜆 * e and the battery force 22), ( 23), (25c ), (25d ), (25e), (25 f ), (25g), (28b)…”
Section: Analysis Based On Pmp Principlementioning
confidence: 99%
“…To improve computational efficiency while obtaining optimal solutions, an alternative way is to reformulate the problem as a convex problem by convex relaxation and approximation techniques [21,22]. An approximation of energy consumption model is used to reformulate the original problem as a convex program [23,24]. In addition, an exact convex relaxation is developed in [25] to minimize train operational energy consumption, which can obtain globally optimal solutions.…”
Section: Introductionmentioning
confidence: 99%