Zhandong Xu

Prof. Zhandong Xu

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 November 2020 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
ZXZhandong Xu
Zhandong Xu
JXJun Xie
Jun Xie
XLXiaobo Liu
Xiaobo Liu
YNYu (Marco) Nie
Yu (Marco) Nie

1 July 2022 in Transportation Science
Verified
Journal Article
Closed access
ZXZhandong Xu
Zhandong Xu
JXJun Xie
Jun Xie
XLXiaobo Liu
Xiaobo Liu
YNYu (Marco) Nie
Yu (Marco) Nie
Strategy-based equilibrium traffic assignment (SETA) problems define travel choice broadly as a strategy rather than a simple path. Travelers navigating through a network based on a strategy end up following a hyperpath. SETA is well suited to represent a rich set of travel choices that take place en route at nodes, such as transit passengers’ transfer decisions, truckers’ bidding decisions, and taxi drivers’ reposition decisions. This paper recognizes and highlights the commonalities among classical and emerging SETA problems and proposes to unify them within the same modeling framework, built on the concept of a hypergraph. A generic hyperbush algorithm (HBA) is developed by decomposing a hypergraph into destination-based hyperbushes. By constructing hyperbushes and limiting traffic assignments to them, HBA promises to obtain more precise solutions to larger instances of SETA problems at a lower computational cost, both in terms of CPU time and memory consumption. To demonstrate its generality and efficiency, we tailor HBA to solve two SETA problems. The results confirm that HBA consistently outperforms the benchmark algorithms in the literature, including two state-of-the-art hyperpath-based algorithms. To obtain high-quality equilibrium solutions for SETA instances of practical size, HBA runs up to five times faster than the best competitor with a fraction of its memory consumption.

23 November 2023 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
ZXZhandong Xu
Zhandong Xu
YPYiyang Peng
Yiyang Peng
GLGuoyuan Li
Guoyuan Li
Anthony ChenAnthony Chen
Anthony Chen
XLXiaobo Liu
Xiaobo Liu

29 April 2023 in Transportation Research Part B: Methodological
Verified
Journal Article
Closed access
ZXZhandong Xu
Zhandong Xu
Anthony ChenAnthony Chen
Anthony Chen
XLXiaobo Liu
Xiaobo Liu

27 June 2023 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
ZLZhengyang Li
Zhengyang Li
GLGuoyuan Li
Guoyuan Li
ZXZhandong Xu
Zhandong Xu
ACAnthony Chen
Anthony Chen

29 October 2018 in IET Intelligent Transport Systems
Verified
Journal Article
Open access
PDF file
PCPeng Cao
Peng Cao
ZXZhandong Xu
Zhandong Xu
QFQiaochu Fan
Qiaochu Fan
XLXiaobo Liu
Xiaobo Liu
Mandatory lane change (MLC) is a critical step in formulating global route of an autonomous vehicle on the urban road network. Improper MLC decisions on arterial roads could jeopardise efficiency (travel cost) and reliability (possibility of failed lane change). However, the existing research studies seldom investigate the optimal MLC decision at the planning level to maximise the reliability‐based driving efficiency. This research aims at addressing two core strategic decision variables (MLC decision point on the road and maximum waiting time before giving up MLC). A series of simulation experiments for various scenarios are conducted for an arterial road to reveal their relationship. The results indicate that both identified decision variables inherently affect travel time spent on this road and the rate of failed MLCs, and a trade‐off exists between arterial travel time and the rate of failed MLCs. Based on the simulation analysis, an analytical lane‐level link performance (LLP) function is formulated to assess the impacts of MLC decisions on driving efficiency. The analysis validates that the optimal MLC strategic decision (MLC decision position and maximum waiting time) can be determined by maximising LLP function. It is promising to apply the proposed LLP function in lane‐level routing algorithm in the future.