- Scheduling with uncertainty or how to create good schedules without knowing the probability distribution, by Alexander Kononov, Novosibirsk State University and Sobolev Institute of Mathematics, Novosibirsk
We discuss new directions in scheduling with uncertainty such as explorable uncertainty, scheduling with testing, query-based approach, resiliency optimization, and untrusted prediction.
- A generic exact solver for vehicle routing problems ans its applications, by Ruslan Sadykov, Inria Bordeaux and Mathematics Institute of Bordeaux
We propose a Branch-Cut-and-Price (BCP) solver for a generic model that encompasses a wide class of vehicle routing problems (VRPs), including some classic variants. It incorporates the key elements found in the best existing VRP algorithms, all generalized through the new concepts of “packing set” and “elementarity set”. Extensive experiments on several variants show that the generic solver has an excellent overall performance, in many problems being better than the best specific algorithms. The solver can be downloaded and used for free for academic purposes though a simple Julia language interface provided by the JuMP library. We also briefly present two our works which use the solver. In the first work, we present an exact BCP algorithm for the robust capacitated VRP with knapsack uncertainty. In the second work, we devise a simple Partial OPtimization Metaheuristic Under Special Intensification Conditions (POPMUSIC) that uses the solver to solve subproblems. We show efficiency of this matheuristic for solving the capacitated vehicle routing problem and its variants.