This is the authors' abstract. We don't add key points for this paper.
We present a general local search framework for scenario-based two-stage combinatorial stochastic programming problems. The framework is based on Adaptive Large Neighborhood Search (ALNS), where an upper-level local search method operates on the first-stage decision variables, while a number of lower-level local search methods optimize the individual scenarios. As a demonstration of the Stochastic ALNS algorithm, the framework is tested on the two-stage stochastic Prize-collecting Vehicle Routing Problem . Customers, demands as well as travel times can be stochastic, as long as they can be represented by a set of scenarios. Various destroy and repair neighborhoods are presented for both the upper-level and lower-level ALNS algorithms. Computational experiments show that the algorithm scales well with the number of scenarios, making it possible to find high-quality solutions for instances with up to 1000 customers and 16 scenarios within half an hour.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
David Pisinger (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: