Paper
22 December 2022 Cross-time transportation network improvement strategies under supply and demand uncertainty
Xinxin Yu, Guoyi Tang, Zonghao Rao, Xiongjun Han, Changzhi Bian, Ying Liu, Jie Shao, Heling Liu
Author Affiliations +
Proceedings Volume 12460, International Conference on Smart Transportation and City Engineering (STCE 2022); 1246018 (2022) https://doi.org/10.1117/12.2657862
Event: International Conference on Smart Transportation and City Engineering (STCE 2022), 2022, Chongqing, China
Abstract
Traditional transportation planning is based on deterministic assumptions which can result in unreasonable conclusion in the planning scheme. This paper considers the network optimization problem under the condition of cross-time decision-making. Assuming that supply and demand obey the known random distribution, we further give the network design model of stochastic bi-level programming. The objective function of the upper model is to maximize the net present value of the system, and the lower model uses traditional user equilibrium model. Genetic algorithm with Monte Carlo is used to solve the cross-time transportation network design problem under supply and demand uncertainty. The Sioux Falls network example shows that the model can be applied to medium-sized networks.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xinxin Yu, Guoyi Tang, Zonghao Rao, Xiongjun Han, Changzhi Bian, Ying Liu, Jie Shao, and Heling Liu "Cross-time transportation network improvement strategies under supply and demand uncertainty", Proc. SPIE 12460, International Conference on Smart Transportation and City Engineering (STCE 2022), 1246018 (22 December 2022); https://doi.org/10.1117/12.2657862
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Network architectures

Roads

Genetic algorithms

Computer programming

Calcium

Monte Carlo methods

Tantalum

Back to Top