Zhibin Jiang

Zhibin Jiang

Auto-generated profile, based on publicly available information

Zhibin Jiang

Tongji Univ, Coll Transportat Engn, Shanghai 201804, Peoples R China

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 March 2018 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
ZJZhibin Jiang
Zhibin Jiang
WFWei Fan
Wei Fan
WLWei Liu
Wei Liu
BZBingqin Zhu
Bingqin Zhu
JGJinjing Gu
Jinjing Gu

1 December 2018 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
YSYanshuo Sun
Yanshuo Sun
ZJZhibin Jiang
Zhibin Jiang
JGJinjing Gu
Jinjing Gu
MZMin Zhou
Min Zhou
YLYeming Li
Yeming Li
LZLei Zhang
Lei Zhang

13 April 2015 in Promet - Traffic&Transportation
Verified
Journal Article
Open access
PDF file
ZJZhibin Jiang
Zhibin Jiang
CXChao Xie
Chao Xie
TJTingting Ji
Tingting Ji
Xiaolei ZouXiaolei Zou
Xiaolei Zou
Understanding the nature of rail transit dwell time has potential benefits for both the users and the operators. Crowded passenger trains cause longer dwell times and may prevent some passengers from boarding the first available train that arrives. Actual dwell time and the process of passenger alighting and boarding are interdependent through the sequence of train stops and propagated delays. A comprehensive and feasible dwell time simulation model was developed and optimized to address the problems associated with scheduled timetables. The paper introduces the factors that affect dwell time in urban rail transit systems, including train headway, the process and number of passengers alighting and boarding the train, and the inability of train doors to properly close the first time because of overcrowded vehicles. Finally, based on a time-driven micro-simulation system, Shanghai rail transit Line 8 is used as an example to quantify the feasibility of scheduled dwell times for different stations, directions of travel and time periods, and a proposed dwell time during peak hours in several crowded stations is presented according to the simulation results.

22 March 2015 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
YTYuyan Tan
Yuyan Tan
ZJZhibin Jiang
Zhibin Jiang
With the aim of supporting the process of adapting railway infrastructure and future traffic needs, we have developed a method to insert additional trains efficiently to an existing timetable without introducing large consecutive delays to scheduled trains. In this work, the problem is characterized as a job-shop scheduling problem. In order to meet the limited time requirement and minimize deviations to the existing timetable, the modification that consists of retiming or reordering trains is implemented if and only if it potentially leads to a better solution. With these issues in mind, the problem of adding train paths is decomposed into two subproblems. One is finding the optimal insertion for a fixed order timetable and the other is reordering trains. The two subproblems are solved iteratively until no improvement is possible within a time limit of computation. An innovative branch and bound algorithm and iterative reordering strategy are proposed to solve this problem in real time. Unoccupied capacities are utilized as primary resources for additional trains and the transfer connections for passengers can be guaranteed in the new timetable. From numerical investigations, the proposed framework and associated techniques are tested and shown to be effective.

20 April 2020 in IEEE Access
Verified
Journal Article
Open access
YTYuyan Tan
Yuyan Tan
ZJZhi-Bin Jiang
Zhi-Bin Jiang
YLYa-Xuan Li
Ya-Xuan Li
RWRu-Xin Wang
Ru-Xin Wang
With the aim of supporting the process of scheduling a hybrid cyclic timetable and adapting traffic needs, this paper is concerned with inserting additional train paths problem for tactical and short-term planning applications with multiple objectives. Focusing on an existing cyclic timetable on a high-speed passenger rail line, the problem is to minimize both the total adjustments for initial trains and the number of required train-sets. The timetable scheduling, train-set planning and rescheduling are three complex optimization problems respectively and usually solved in a sequential manner. In this paper, these phases are integrated in a mixed integer programming model, and the multi-objective adding train paths (ATP) model is proposed, which decides simultaneously initial trains' modifications, additional trains' schedules and train-set circulation. The tolerance of disruption for initial trains including allowed adjustment and periodic structure is taken into account in light of the practical concerns. The difficulty of this integrated problem is that train-sets circulation is usually determined after all of the train lines and timetable have been fixed. However, in the adding train paths problem, the additional trains do not exist in the initial timetable. In order to solve the problem in a reasonable time, a relaxation approach to the adding paths problem is presented. We start from fixed train-set route, and then apply flexible train-set route that provides possible alternative turning activities to decrease the number of required train-sets. A case study based on Shanghai-Hangzhou high-speed rail line in China illustrates the methodology and compares the performance of various settings of perturbation tolerance, time window and train-set applications.

1 January 2014 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
ZJZhibin Jiang
Zhibin Jiang
YTYuyan Tan
Yuyan Tan
ÖYÖzgür Yalçınkaya
Özgür Yalçınkaya
This paper deals with the problem of scheduling additional train unit (TU) services in a double parallel rail transit line, and a mixed integer programming (MIP) model is formulated for integration strategies of new trains connected by TUs with the objective of obtaining higher frequencies in some special sections and special time periods due to mass passenger volumes. We took timetable scheduling and TUs scheduling as an integrated optimization model with two objectives: minimizing travel times of additional trains and minimizing shifts of initial trains. We illustrated our model using computational experiments drawn from the real rail transit line 16 in Shanghai and reached results which show that rail transit agencies can obtain a reasonable new timetable for different managerial goals in a matter of seconds, so the model is well suited to be used in daily operations.