Yao Chen

Dr. Yao Chen

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
1 January 2023 in Transportation Science
Verified
Journal Article
Closed access
YCYao Chen
Yao Chen
YLYang Liu
Yang Liu
Shared autonomous electric vehicle systems will be a promising alternative for sustainable urban mobility. This study investigates an integrated optimization problem for shared autonomous electric vehicle systems that determines the long-term charging facility deployment at the planning level (e.g., the sizing and configurations of charging facilities), while the vehicle assignment, relocation, and charging decisions in the short term are also optimized at the operational level. A two-stage stochastic integer program is formulated to capture the demand uncertainty, in which an event-activity space-time-battery network is proposed for tracking the charging choices and battery states of vehicles and determining the optimal operational decisions. For dealing with a large number of scenarios in the stochastic program, the sample average approximation scheme is applied as the sampling strategy. An accelerated two-phase Benders decomposition-based algorithm is proposed for solving the two-stage program. The modeling and algorithm approach is tested on a large-scale case in Shanghai City in China. Extensive experiments show that the proposed approach can always find high-quality solutions in an efficient way. Numerical results indicate that deployment of both normal- and fast-charging infrastructure can increase the system profit and improve its operational performance. Funding: This work was supported by the Singapore Ministry of Education Academic Research Fund Tier 1 [Grant R-266-000-135-114] and by the National Natural Science Foundation of China [Grants 71971021 and 72101019]. Supplemental Material: The e-companion is available at https://doi.org/10.1287/trsc.2022.1156 .

1 February 2019 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
YCYao Chen
Yao Chen
BMBaohua Mao
Baohua Mao
YBYun Bai
Yun Bai
THTin Kin Ho
Tin Kin Ho
ZLZhujun Li
Zhujun Li

21 January 2022 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
HGHao Guo
Hao Guo
YCYao Chen
Yao Chen
YLYang Liu
Yang Liu

28 August 2020 in Journal of Advanced Transportation
Verified
Journal Article
Open access
PDF file
KHKai Huang
Kai Huang
LXLin Xu
Lin Xu
YCYao Chen
Yao Chen
QCQixiu Cheng
Qixiu Cheng
KAKun An
Kun An
This paper investigates the real-time customized bus (CB) route optimization problem, which aims to maximize the service rate for clients and profits for operators. The on-road bus has a flexible route, which can be updated based on the real-time data and route optimization solutions. A two-phase framework is established. In phase 1, the vehicle-related data including existing route and schedule, client-related data involving pick-up/drop-off location, and time windows are collected once receiving a new CB request. The second phase optimizes the bus route by establishing three nonlinear programming models under the given data from phase 1. A concept of profit difference is introduced to decide the served demand. To improve computation efficiency, a real-time search algorithm is proposed that the neighboring buses are tested one by one. Finally, a numerical study based on Sioux Falls network reveals the effectiveness of the proposed methodology. The results indicate that the real-time route optimization can be achieved within the computation time of 0.17–0.38 seconds.

3 July 2019 in Journal of Advanced Transportation
Verified
Journal Article
Open access
PDF file
YCYao Chen
Yao Chen
BMBaohua Mao
Baohua Mao
YBYun Bai
Yun Bai
THTin Kin Ho
Tin Kin Ho
ZLZhujun Li
Zhujun Li
Last train coordination aims to synchronize the arrival and departure times of the last feeder trains and the last connecting trains at transfer stations to improve the transfer accessibility of urban rail networks. This study focuses on the transfer accessibility between last trains with considering heterogeneous transfer walking time. Three mathematical models are developed on the last train timetable optimization. The first model fine-tunes the last train timetable under the given bound of the dwell time. The second one aims to allow the mutual transfers with the prolonged dwell time to maximize the transfer accessibility. A biobjective function is proposed to seek the trade-off between the maximal transfer accessibility and the minimal extension of dwell time. The third model considers the heterogeneity of transfer walking time that is represented as a random variable following a probability distribution. A discrete approximation method is proposed to reformulate the nonlinear model. The embedded Branch & Cut algorithm of CPLEX is applied to solve the models. A real case on the Shenzhen metro network is conducted to demonstrate the performance of the models. The three models all provide better last train timetable than the current timetable in practice. The sensitivity analysis manifests that the third model are always advantageous in the optimization of successful transfer passengers.

4 May 2024 in Ocean Engineering
Verified
Journal Article
Open access
HGHassan Gonabadi
Hassan Gonabadi
SHSeyed Farhad Hosseini
Seyed Farhad Hosseini
YCYao Chen
Yao Chen
SBSteve Bull
Steve Bull