Simulation-Based Robust and Adaptive Optimization Method for Heteroscedastic Transportation Problems

Ziyuan Gu, Yifan Li, M. Saberi, Zhiyuan Liu
{"title":"Simulation-Based Robust and Adaptive Optimization Method for Heteroscedastic Transportation Problems","authors":"Ziyuan Gu, Yifan Li, M. Saberi, Zhiyuan Liu","doi":"10.1287/trsc.2023.0485","DOIUrl":null,"url":null,"abstract":"Simulation-based optimization is an effective solution to complex transportation problems relying on stochastic simulations. However, existing studies generally perform a fixed number of evaluations for each decision vector across the design space, overlooking simulation heteroscedasticity and its effects on solution efficiency and robustness. In this paper, we treat the number of evaluations as an adaptive variable depending upon the simulation heteroscedasticity and the potential optimality of each decision vector. A statistical method, which automatically determines the variable number of evaluations, is presented for a range of derivative-free optimization methods. By fusing Bayesian inference with the probability of correct selection, it permits adaptive allocation of budgeted computational resources to achieve improved solution efficiency and robustness. The method is integrated with the deterministic global optimizer DIviding RECTangles (DIRECT) to yield NoisyDIRECT as a continuous simulation-based robust optimization method (which is open sourced). The key properties of the method are proved and discussed. Numerical experiments on difficult test functions are first conducted to verify the improvement of NoisyDIRECT compared with DIRECT and Bayesian optimization. Given the same computational budget, NoisyDIRECT can better locate the global optimum than the other two alternatives. Applications to representative simulation-based transportation problems, including an M/M/1 queueing problem and a parking pricing problem, are then presented. The results demonstrate the ability of NoisyDIRECT to pinpoint the optimal solution via adaptive computational resources allocation, achieving the desired level of robustness. Funding: This work was supported by the Youth Program [Grant 52102375] and the Key Project [Grant 52131203] of the National Natural Science Foundation of China, the Youth Program [Grant BK20210247] of the Natural Science Foundation of Jiangsu Province, and the High-Level Personnel Project of Jiangsu Province [Grant JSSCBS20220099]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0485 .","PeriodicalId":510068,"journal":{"name":"Transportation Science","volume":"31 10","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/trsc.2023.0485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Simulation-based optimization is an effective solution to complex transportation problems relying on stochastic simulations. However, existing studies generally perform a fixed number of evaluations for each decision vector across the design space, overlooking simulation heteroscedasticity and its effects on solution efficiency and robustness. In this paper, we treat the number of evaluations as an adaptive variable depending upon the simulation heteroscedasticity and the potential optimality of each decision vector. A statistical method, which automatically determines the variable number of evaluations, is presented for a range of derivative-free optimization methods. By fusing Bayesian inference with the probability of correct selection, it permits adaptive allocation of budgeted computational resources to achieve improved solution efficiency and robustness. The method is integrated with the deterministic global optimizer DIviding RECTangles (DIRECT) to yield NoisyDIRECT as a continuous simulation-based robust optimization method (which is open sourced). The key properties of the method are proved and discussed. Numerical experiments on difficult test functions are first conducted to verify the improvement of NoisyDIRECT compared with DIRECT and Bayesian optimization. Given the same computational budget, NoisyDIRECT can better locate the global optimum than the other two alternatives. Applications to representative simulation-based transportation problems, including an M/M/1 queueing problem and a parking pricing problem, are then presented. The results demonstrate the ability of NoisyDIRECT to pinpoint the optimal solution via adaptive computational resources allocation, achieving the desired level of robustness. Funding: This work was supported by the Youth Program [Grant 52102375] and the Key Project [Grant 52131203] of the National Natural Science Foundation of China, the Youth Program [Grant BK20210247] of the Natural Science Foundation of Jiangsu Province, and the High-Level Personnel Project of Jiangsu Province [Grant JSSCBS20220099]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0485 .
基于仿真的异速交通问题鲁棒自适应优化方法
基于模拟的优化是解决复杂交通问题的有效方法,它依赖于随机模拟。然而,现有研究通常对设计空间中的每个决策向量执行固定数量的评估,忽略了模拟异方差及其对解决方案效率和稳健性的影响。在本文中,我们根据仿真异方差性和每个决策向量的潜在最优性,将评估次数视为一个自适应变量。本文针对一系列无导数优化方法提出了一种统计方法,该方法可自动确定可变的评估次数。通过将贝叶斯推理与正确选择概率相融合,该方法允许对预算计算资源进行自适应分配,以提高求解效率和鲁棒性。该方法与确定性全局优化器DIviding RECTangles (DIRECT)相结合,产生了基于连续模拟的鲁棒优化方法NoisyDIRECT(该方法已开源)。对该方法的关键特性进行了证明和讨论。首先对困难的测试函数进行了数值实验,以验证 NoisyDIRECT 与 DIRECT 和贝叶斯优化法相比的改进效果。在计算预算相同的情况下,NoisyDIRECT 比其他两种方法能更好地找到全局最优值。随后介绍了基于模拟的代表性交通问题的应用,包括 M/M/1 排队问题和停车定价问题。结果表明,NoisyDIRECT 能够通过自适应计算资源分配精确定位最优解,达到所需的鲁棒性水平。资助:本研究得到国家自然科学基金青年项目[52102375]和重点项目[52131203]、江苏省自然科学基金青年项目[BK20210247]和江苏省高层次人才项目[JSSCBS20220099]的资助。补充材料:在线附录见 https://doi.org/10.1287/trsc.2023.0485 。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信