A Sampling Strategy for High-Dimensional, Simulation-Based Transportation Optimization Problems

被引:0
作者
Tay, Timothy [1 ]
Osorio, Carolina [2 ]
机构
[1] ASTAR, Inst Infocomm Res I2R, Singapore 138632, Singapore
[2] HEC Montreal, Dept Decis Sci, Montreal, PQ H3T 2A7, Canada
关键词
continuous simulation-based optimization; sampling distribution; exploration; traffic signal control; BAYESIAN OPTIMIZATION; STOCHASTIC OPTIMIZATION; TRAFFIC CONTROL; ALGORITHM; CALIBRATION; FRAMEWORK; MODELS;
D O I
10.1287/trsc.2023.0110
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
When tackling high -dimensional, continuous simulation -based optimization (SO) problems, it is important to balance exploration and exploitation. Most past SO research focuses on the enhancement of exploitation techniques. The exploration technique of an SO algorithm is often defined as a general-purpose sampling distribution, such as the uniform distribution, which is inefficient at searching high -dimensional spaces. This work is motivated by the formulation of exploration techniques that are suitable for large-scale transportation network problems and high -dimensional optimization problems. We formulate a sampling mechanism that combines inverse cumulative distribution function sampling with problem -specific structural information of the underlying transportation problem. The proposed sampling distribution assigns greater sampling probability to points with better expected performance as defined by an analytical network model. Validation experiments on a toy network illustrate that the proposed sampling distribution has important commonalities with the underlying and typically unknown true sampling distribution of the simulator. We study a high -dimensional traffic signal control case study of Midtown Manhattan in New York City. The results show that the use of the proposed sampling mechanism as part of an SO framework can help to efficiently identify solutions with good performance. Using the analytical information for exploration, regardless of whether it is used for exploitation, outperforms benchmarks that do not use it, including standard Bayesian optimization. Using the analytical information for exploration only yields solutions with similar performance than when the information is used for exploitation only, reducing the total compute times by 65%. This paper sheds light on the importance of developing suitable exploration techniques to enhance both the scalability and the compute efficiency of general-purpose SO algorithms.
引用
收藏
页码:947 / 972
页数:27
相关论文
共 56 条
[1]  
Abramowitz M., 1964, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
[2]  
[Anonymous], 2004, Modern Proba- bility and Statistics: Queueing Theory
[3]  
[Anonymous], 2010, Ph.D. thesis
[4]  
[Anonymous], 2013, Proc. Adv. Neural Inf. Process. Syst
[5]  
[Anonymous], 2006, The theory behind the "randfixedsum" function
[6]   Incorporating Within-Day Transitions in Simultaneous Offline Estimation of Dynamic Origin-Destination Flows Without Assignment Matrices [J].
Balakrishna, Ramachandran ;
Koutsopoulos, Haris N. .
TRANSPORTATION RESEARCH RECORD, 2008, (2085) :31-38
[7]  
Barceló J, 2010, INT SER OPER RES MAN, V145, P1, DOI 10.1007/978-1-4419-6142-6_1
[8]   Evaluation of freeway control using a microscopic simulation laboratory [J].
Ben-Akiva, M ;
Cuneo, D ;
Hasan, M ;
Jha, M ;
Yang, Q .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2003, 11 (01) :29-50
[9]  
Campbell SL, 1991, CLASSICS APPL MATH, V56
[10]  
Casella G., 2002, Statistical Inference, V2nd