Tom Wüllner

Optimal Refinement in Dynamic Discretisation Discovery for Continuous-Time Service Network Design

Categories Combinatorial Optimization, Network Optimization, Transportation

Dynamic Discretisation Discovery (DDD) is a framework for solving a problem by iteratively solving and refining a relaxed version of the problem. DDD is the basis for state-of-the-art algorithms for various problems, including the continuous-time service network design problem (CTSNDP), which we study here. In the refinement step, such algorithms must identify conflicts in the … Read more

Finding Minimal Discretizations in Dynamic Discretization Discovery for Continuous-Time Service Network Design

Categories Combinatorial Optimization, Network Optimization, Transportation Tags , , ,

The dynamic discretization discovery framework is a powerful tool for solving network design problems with a temporal component by iteratively refining a time-discretized model. Existing approaches refine the time discretization in ways that guarantee eventual termination. However, refinement choices are not unique, and better choices can yield smaller and easier-to-solve time-discretized models. We pose the … Read more