Zhipeng Huang

Dr. Zhipeng Huang

School of Traffic and Transportation, Lanzhou Jiaotong University
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

7 February 2022 in Transportation Letters
Verified
Journal Article
Closed access
ZHZhipeng Huang
Zhipeng Huang
YZYuzhao Zhang
Yuzhao Zhang
ZZZhenjiang Zhang
Zhenjiang Zhang
LYLixing Yang
Lixing Yang
There are a number of trains running in high-speed railway (HSR) corridors throughout the day, which results in diverse passenger travel choices. Passengers can select their preferred train according to their favorite departure time and seat class based on a fixed train timetable, that is, the selection differences from departure time to seat classes are dramatic. The train timetable determines the distribution of passenger flow on trains, and the requirement distribution in turn affects the train timetable. To address this game relationship, this paper develops a method to optimize uneven running train timetables with a given total number of trains considering passenger departure time and seat-class preferences. We analyze the impact of departure time and seat class on passenger choice behaviors and build a time-space-seat 3-dimensional network to account for these choices. Then, the impedance function of each type of arc in the network is designed. In addition, a bi-level programming model is constructed to optimize the train timetable in the HSR corridor; the upper-level model calculates train departure time, arrival time and dwelling time at each station and determines the assignment of car lists with different seat classes for each train. The lower-level model is used to distribute the passenger flow to each train. Combined with the user equilibrium principle, a complex genetic algorithm embedded with the Frank–Wolfe method is designed to reasonably distribute passenger flows to each train. Finally, we take the Lanzhou-Xi’an HSR as an example to test both the model and the algorithm. The results show that the optimal train timetable can meet the requirements of both seat class and departure time with appropriate solution time limitations.

14 June 2023 in Sustainability
Verified
Journal Article
Open access
PDF file
JWJianqiang Wang
Jianqiang Wang
WZwenlong zhao
wenlong zhao
CLChenglin Liu
Chenglin Liu
ZHZhipeng Huang
Zhipeng Huang
Optimizing the train plan for high-speed rail systems should consider both the passengers’ demands and enterprise’s benefits. The choice of the departure time period is the most important factor affecting the passenger demand distribution. In this paper, the optimization problem of a train operation plan based on time period preference is studied for a high-speed rail corridor. First, according to the travel process of the passengers, the extended service network for a high-speed rail system is established. The main factors that influence the passengers’ travel choices are analyzed, and the departure time period preference, stop time and flexible pricing strategy based on the time period preference are put forward. The generalized travel cost function, including the convenience, ticket fare and stop time costs, is constructed, and a two-level programming model is established based on the function. The upper-level planning model is formulated as a mixed 0–1 programming problem that aims at maximizing the revenue of the railway enterprise. It is mainly constrained by passenger travel demand and solved by improved genetic algorithms. The lower-level model is a user equilibrium (UE) model. The Frank–Wolfe algorithm is used to allocate multiple groups of OD (origin and destination) passenger flows to each train so that the generalized travel expenses of all the passengers with the same OD are minimized and equal. Finally, the train operation plan is solved based on the Lan-xi (Lanzhou–Xi’an) high-speed rail data, and the validity of both the model and algorithm is verified.


9 March 2021 in Journal of Advanced Transportation
Verified
Journal Article
Open access
PDF file
ZHZhipeng Huang
Zhipeng Huang
HNHuimin Niu
Huimin Niu
RGRuhu Gao
Ruhu Gao
HFHaoyu Fan
Haoyu Fan
CLChenglin Liu
Chenglin Liu
Passengers would like to choose the most suitable train based on their travel preferences, expenses, and train timetable in the high-speed railway corridor. Meanwhile, the railway department will constantly adjust the train timetable according to the distribution of passenger flows during a day to achieve the optimal operation cost and energy consumption saving plan. The question is how to meet the differential travel needs of passengers and achieve sustainable goals of service providers. Therefore, it is necessary to design a demand-oriented and environment-friendly high-speed railway timetable. This paper formulates the optimization of train timetable for a given high-speed railway corridor, which is based on the interests of both passengers and transportation department. In particular, a traveling time-space network with virtual departure arc is constructed to analyze generalized travel costs of passengers of each origin-destination (OD), and bilevel programming model is used to optimize the problem. The upper integer programming model regards the minimization of the operating cost, which is simplified to the minimum traveling time of total trains, as the goal. The lower level is a user equilibrium model which arranges each OD passenger flow to different trains. A general advanced metaheuristic algorithm embedded with the Frank–Wolfe method is designed to implement the bilevel programming model. Finally, a real-world numerical experiment is conducted to verify the effectiveness of both the model and the algorithm.

9 April 2025 in Information Processing & Management
Verified
Journal Article
Closed access
WLWenzheng Liu
Wenzheng Liu
HLHongtao Li
Hongtao Li
HZHaina Zhang
Haina Zhang
SSShaolong Sun
Shaolong Sun
ZHZhipeng Huang
Zhipeng Huang
WXWuzhi Xie
Wuzhi Xie