Machine Learning-Augmented Optimization of Large Bilevel and Two-Stage Stochastic Programs: Application to Cycling Network Design

• 成果类型: Article
• 署名作者: Chan, Timothy C. Y.; Lin, Bo; Saxe, Shoshanna
• 署名单位: University of Toronto; University of Toronto
• 刊物名称: M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
• ISSN/ISSBN: 1523-4614
• DOI: 10.1287/msom.2024.1317
• 发表日期: 2025
• 关键词: selection; MODEL

摘要

Problem definition: A wide range of decision problems can be formulated as bilevel programs with independent followers, which, as a special case, include two-stage stochastic programs. These problems are notoriously difficult to solve, especially when a large number of followers are present. Motivated by a real-world cycling infrastructure planning application, we present a general approach to solving such problems. Methodology/results: We propose an optimization model that explicitly considers a sampled subset of followers and exploits a machine learning model to estimate the objective values of unsampled followers. We prove bounds on the optimality gap of the generated leader decision as measured by the original objective function that considers the full follower set. We then develop follower sampling algorithms to tighten the bounds and a representation learning approach to learn follower features, which are used as inputs to the embedded machine learning model. Through numerical studies, we show that our approach generates leader decisions of higher quality compared with baselines. Finally, in collaboration with the City of Toronto, we perform a real-world case study in Toronto, where we solve a cycling network design problem with over one million followers. Compared with the current practice, our approach improves Toronto's cycling accessibility by 19.2%, equivalent to $18 million in potential cost savings. Managerial implications: Our approach is being used to inform the cycling infrastructure planning in Toronto and can be generalized to any decision problems that are formulated as bilevel programs with independent followers.