Dingtong Yang

Dingtong Yang

Auto-generated profile, based on publicly available information

Dingtong Yang

Singapore

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
26 June 2024 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Open access
DYDingtong Yang
Dingtong Yang
MHMichael Hyland
Michael Hyland
RJR. Jayakrishnan
R. Jayakrishnan

25 September 2025 in Transportation Research Part A: Policy and Practice
Verified
Journal Article
Closed access
NSNegin Shariat
Negin Shariat
DYDingtong Yang
Dingtong Yang
RJR. Jayakrishnan
R. Jayakrishnan

21 June 2026 in Transportation Planning and Technology
Verified
Journal Article
Closed access
PSPengyuan Sun
Pengyuan Sun
DYDingtong Yang
Dingtong Yang
RJR. Jayakrishnan
R. Jayakrishnan

6 November 2026 in Computers & Industrial Engineering
Verified
Journal Article
Open access
YLYubin Liu
Yubin Liu
JEJose Escribano-Macias
Jose Escribano-Macias
DYDingtong Yang
Dingtong Yang
KZKeyang Zhang
Keyang Zhang
PAPanagiotis Angeloudis
Panagiotis Angeloudis

20 September 2020
Verified
Conference Paper
Open access
JSJ.S. Navjyoth Sarma
J.S. Navjyoth Sarma
DNDaisik Nam
Daisik Nam
MHMichael Hyland
Michael Hyland
FSFelipe de Souza
Felipe de Souza
DYDingtong Yang
Dingtong Yang
IVI. Omer Verbas
I. Omer Verbas
This paper addresses the problem of dynamically matching automated vehicles (AVs) to open traveler requests in a large-scale automated-mobility-on-demand (AMOD) simulation framework. While optimization-based matching strategies based on the linear assignment problem formulation significantly outperform simple heuristic strategies (e.g. nearest neighbor), the scalability of the assignment problem limits its applicability to large problem instances. This study proposes a fleet dispatching strategy to dynamically assign AVs to travelers that involves the assignment problem formulation but restricts the decision space to reduce computational time. First, we significantly trim the decision space via only considering the k-closest open requests around each idle vehicle or k-closest idle vehicles around each open request. Second, we only calculate point-to-point shortest paths for vehicles and travelers that are close in spatial proximity. For vehicles and travelers that are not close in proximity, we use zone-to-zone travel time estimates. This study embeds the proposed AV fleet dispatching strategy within Polaris–an agent-based transportation simulation modeling framework. Within Polaris, the restricted fleet dispatching strategy proposed in this significantly outperforms (i) existing large-scale strategies in terms of fleet performance and (ii) the unrestricted assignment problem strategy in terms of computational performance.