Jing-Peng Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jing-Peng Wang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Hai-Jun Huang
3 shared publicationsPeng Liu
3 shared publicationsQiong Tian
2 shared publicationsXuegang (Jeff) Ban
2 shared publications- Yang Cui2 shared publications
Yong Zhou
2 shared publications
Latest Publications
- Open Access
- 3 April 2026
- Published by Elsevier in SSRN Electronic Journal
Route Efficiency and Carbon Emissions of Urban UAV Delivery: Evidence from Shenzhen
Urban UAV delivery is frequently discussed as a faster and potentially lower-emission alternative to ground-based last-mile logistics,but evidence from repeated urban commercial operations remains limited. Using commercial telemetry from Shenzhen, this study examines route efficiency and scenario-based operational carbon performance in an urban UAV delivery network. We reconstruct 46,409 trajectories and retain 45,256 valid origin-destination routes, comparing cumulative three-dimensional flown distance with routed road distance from the Open Source Routing Machine (OSRM). Observed UAV paths are on average 15.78% shorter, saving about 1.08 km per delivery. Under baseline assumptions, mean operational emissions are 0.080 kgCO2 per UAV delivery, versus 0.243 kgCO2 for electric delivery and 1.022 kgCO2 for fuel delivery. The route advantage is largest where road alternatives are more circuitous, while the carbon advantage over electric delivery narrows and disappears on the shortest trips. The findings highlight the importance of routed baselines and explicit operational carbon assumptions.
- 3 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessRoute Efficiency and Carbon Emissions of Urban UAV Delivery: Evidence from Shenzhen
Urban UAV delivery is frequently discussed as a faster and potentially lower-emission alternative to ground-based last-mile logistics,but evidence from repeated urban commercial operations remains limited. Using commercial telemetry from Shenzhen, this study examines route efficiency and scenario-based operational carbon performance in an urban UAV delivery network. We reconstruct 46,409 trajectories and retain 45,256 valid origin-destination routes, comparing cumulative three-dimensional flown distance with routed road distance from the Open Source Routing Machine (OSRM). Observed UAV paths are on average 15.78% shorter, saving about 1.08 km per delivery. Under baseline assumptions, mean operational emissions are 0.080 kgCO2 per UAV delivery, versus 0.243 kgCO2 for electric delivery and 1.022 kgCO2 for fuel delivery. The route advantage is largest where road alternatives are more circuitous, while the carbon advantage over electric delivery narrows and disappears on the shortest trips. The findings highlight the importance of routed baselines and explicit operational carbon assumptions.
- 14 February 2025
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 196
Joint re-dispatching and pricing on a business-to-consumer ride-hailing platform
- 14 February 2025
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 196
Joint re-dispatching and pricing on a business-to-consumer ride-hailing platform
- 9 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (10) , 17397-17409
Optimal Dynamic Supply of Parking Permits Under Uncertainties: A Stochastic Control Approach
This paper proposes an optimal dynamic supply of parking permits under uncertainties in the mixed traffic environment of regular vehicles (RVs) and autonomous vehicles (AVs). The uncertainties from queuing delay and cruising-for-parking time, respectively, are derived from parking permit holders’ unascertainable early arrival/late departure and the randomness of vehicle speed for cruising-for-parking users. We formulate the dynamic system optimum as a stochastic optimal control problem, aiming to minimize the total time lost for all parking users. On this basis, we express the optimality condition as Hamilton-Jacobi-Bellman equation and propose an optimal control strategy for dynamic supply of parking permits (called optimal parking supply scheme). The proposed scheme is determined by two observable and measurable variables, i.e., queuing time and cruising-for-parking time. We find that the scheme can significantly reduce the total system time lost, especially when the uncertainty from parking permit holders is at a high level or the percentage of AVs is small. Finally, a case study of a selected sample area in Beijing is conducted, which verifies the efficiency of the proposed scheme numerically.
- 9 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (10) , 17397-17409
Optimal Dynamic Supply of Parking Permits Under Uncertainties: A Stochastic Control Approach
This paper proposes an optimal dynamic supply of parking permits under uncertainties in the mixed traffic environment of regular vehicles (RVs) and autonomous vehicles (AVs). The uncertainties from queuing delay and cruising-for-parking time, respectively, are derived from parking permit holders’ unascertainable early arrival/late departure and the randomness of vehicle speed for cruising-for-parking users. We formulate the dynamic system optimum as a stochastic optimal control problem, aiming to minimize the total time lost for all parking users. On this basis, we express the optimality condition as Hamilton-Jacobi-Bellman equation and propose an optimal control strategy for dynamic supply of parking permits (called optimal parking supply scheme). The proposed scheme is determined by two observable and measurable variables, i.e., queuing time and cruising-for-parking time. We find that the scheme can significantly reduce the total system time lost, especially when the uncertainty from parking permit holders is at a high level or the percentage of AVs is small. Finally, a case study of a selected sample area in Beijing is conducted, which verifies the efficiency of the proposed scheme numerically.
- 1 June 2019
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 524, 354-361
Optimal capacity allocation for high occupancy vehicle (HOV) lane in morning commute
- 1 June 2019
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 524, 354-361
Optimal capacity allocation for high occupancy vehicle (HOV) lane in morning commute
- 1 April 2019
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 122, 390-415
Dynamic ridesharing with variable-ratio charging-compensation scheme for morning commute
- 1 April 2019
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 122, 390-415
Dynamic ridesharing with variable-ratio charging-compensation scheme for morning commute
- 1 October 2018
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 118, 589-605
Tradable OD-based travel permits for bi-modal traffic management with heterogeneous users
- 1 October 2018
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 118, 589-605
Tradable OD-based travel permits for bi-modal traffic management with heterogeneous users