ITSC 2024 Paper Abstract

Close

Paper ThBT13.16

Zhang, Zhiyuan (Beijing jiaotong university), Wang, Hongwei (Beijing Jiaotong University), Wang, Xi (National Engineering Research Center of Rail Transportation Oper), Ying, ZhiPeng (China Academy of Railway Sciences), Jin, Jun (China State Railway Group Co., Ltd.), Ning, Pengfei (Beijing Jiaotong University)

Optimization of Heavy Haul Train Speed Profiles under Discrete Notches and Nonlinear Braking Forces

Scheduled for presentation during the Poster Session "Railway systems and applications" (ThBT13), Thursday, September 26, 2024, 14:30−16:30, Foyer

2024 IEEE 27th International Conference on Intelligent Transportation Systems (ITSC), September 24- 27, 2024, Edmonton, Canada

This information is tentative and subject to change. Compiled on October 3, 2024

Keywords Theory and Models for Optimization and Control, Simulation and Modeling

Abstract

Due to the large mass of heavy haul trains, operating on downhill sections poses significant challenges on train control. Drivers must perform air braking and releasing at the appropriate times to prevent the movement of heavy hual train from decoupling and derailment. To promote the smooth operation of the heavy haul train, this research investigates the optimization problem of heavy haul train speed profiles under discrete notches and nolinear braking forces. An optimization model is first established considering constraints such as speed and air-refilling time to maximize the running distance and minimize the air braking time of a train on downhill sections. This model takes into account discrete notches of electric braking force, each with a nonlinear braking profile. To linearize the model, piecewise approximation (PWA) function and auxiliary variables are introduced, transforming the original problem into a mixed integer linear programming (MILP) problem. The proposed MILP problem is then solved using a solver. Simulations using actual data from the Shuohuang Railway illustrate the effectiveness of the proposed methods.

 

 

All Content © PaperCept, Inc.


This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2024 PaperCept, Inc.
Page generated 2024-10-03  03:36:37 PST  Terms of use