Yiyong Pan

Yiyong Pan

Auto-generated profile, based on publicly available information

Yiyong Pan

College of Automobile and Traffic Engineering

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
28 April 2022 in Transportmetrica B: Transport Dynamics
Verified
Journal Article
Closed access
Gen LiGen Li
Gen Li
ZYZhen Yang
Zhen Yang
YPYiyong Pan
Yiyong Pan
Jianxiao MaJianxiao Ma
Jianxiao Ma
This paper aims to investigate the characteristics of discretionary lane change (LC) duration on freeways based on an enriched dataset that contains the LC vehicle trajectories of 2905 passenger cars and 433 heavy vehicles. The LC duration is comprehensively analysed, and four stochastic LC duration models are established according to vehicle type and LC direction. LC duration varies with vehicle type and LC direction. Considering driver heterogeneity, accelerated failure time (AFT) models with fixed parameters, latent classes, and random parameters were established in this paper. The results show that drivers of heavy vehicles display greater heterogeneity and that vehicle types and LC directions have significant influence on the LC duration. The results of this study are helpful for understanding the mechanism of the LC process and the influence of LC on traffic flow and improving the safety of lane-changing behaviours of connected and autonomous vehicles.

30 October 2019 in IEEE Access
Verified
Journal Article
Open access
Gen LiGen Li
Gen Li
YPYiyong Pan
Yiyong Pan
ZYZhen Yang
Zhen Yang
JMJianxiao Ma
Jianxiao Ma

1 January 2019 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
YPYiyong Pan
Yiyong Pan
The study focuses on a multiple constrained reliable path problem in which travel time reliability and resource constraints are collectively considered. Nonlinear optimization model is developed to model constrained robust shortest path problem. The dual nature of the proposed problem is deduced based on the Lagrangian duality theory. An efficient algorithm based on Lagrangian dual relaxation is designed to solve constrained robust shortest path problem. An extension problem that considers multiple constraints is discussed. Numerical studies indicate that the proposed algorithm is efficient in terms of obtaining the close‐to‐optimal solutions within reasonable computational times.

29 June 2016
Verified
Conference Paper
Closed access
YPYiyong Pan
Yiyong Pan
A reliable shortest path problem is focused on finding a reliable a priori shortest path to maximize the probability of travelers arriving at their destination within a given travel time budget in a stochastic network. The mathematical model based on nonlinear mixed integer programming is established to analyze the problem of finding the reliable shortest path in a stochastic traffic network. A penalty method is developed to solve the nonlinear mixed integer programming problem by transforming the proposed problem to an unconstrained nonlinear programming problem through penalty function. Numerical results are provided using a small network and show the validity and feasibility of the proposed method.

15 August 2025 in Traffic Injury Prevention
Verified
Journal Article
Closed access
YPYiyong Pan
Yiyong Pan
SYSaisai Yang
Saisai Yang
CWCongwei Wang
Congwei Wang
Understanding the factors influencing crash severity of autonomous vehicles is important for increasing road safety. This study focuses on a multi-source accident dataset of vehicles equipped with autonomous driving systems to explore the endogenous relationship between manual takeover of autonomous vehicles and the severity of crash, as well as the influencing factors. By screening and summarizing data on autonomous vehicle accidents. We choose self-driving car takeover and crash severity as potential variables to build a structural equation model to explore the influences of crash severity through continuous variable updating and path improvement. We select autonomous vehicle takeover and crash severity as potential variables and designed a structural equation model to explore the factors affecting crash severity through continuous variable updating and path improvement. Meanwhile, we establish a generalized linear logit model to analyze the factors affecting manual takeover. Finally, the intrinsic link between crash severity and manual takeover is discussed through path analysis and comparison of model results. Cloudy and rainy weather, left rear of vehicle contact area, and daylight lighting significantly impact manual takeover and crash severity. Specifically, wet road surface, rainy weather, and daylight have relatively more significant effects on takeover in the structural equation model. And takeover, roadway type including non-freeway and intersection can significantly impact crash severity. Additionally, the study demonstrates the endogeneity between crash severity and takeover at the time of autonomous vehicle crash. This study analyzes the potential relationships and influencing factors between takeover events of autonomous vehicles and crash severity. It is found that the frequency of takeover events significantly increases when driving in rainy weather and at night. It is suggested that a real-time monitoring module for adverse weather or lighting conditions should be added to the autonomous driving system to provide early warnings and reduce the occurrence of takeover events, thereby enhancing the safety and reliability of autonomous vehicles.

18 January 2018
Verified
Conference Paper
Closed access
LCLu Chen
Lu Chen
YPYiyong Pan
Yiyong Pan
In order to optimize the problem of carbon emissions in transportation networks, the environmental shortest path problem is addressed in a traffic network based on carbon emissions. Firstly, the suitable calculation model for carbon emissions is suitably selected. Secondly, a nonlinear constraints optimization mathematical model is established to the environmental shortest path problem through defining carbon emission as the objective function. Thirdly, a label algorithm is constructed to solve the environmental shortest path problem. Finally, numerical results in transportation network show the validity and feasibility of the proposed label algorithm. The results suggest that the environmental shortest path based on carbon emissions is significantly more difficult to solve to optimality than the shortest distance path and least travel time path problem, but offers insight on navigation of “environmental-friendly” vehicle routing.