David

A spatial branch-and-price-and-cut algorithm for finding globally optimal solutions to the continuous network design problem

  • Michael Levin
  • David
    • Categories Bilevel Optimization, Transportation Tags , , , ,

    Transportation network design, or the problem of optimizing infrastructure for a societal goal, subject to individual travelers optimizing their behavior for their own preferences arises frequently in many contexts. However, it is also an NP-hard problem due to the leader-follower or bi-level structure involving a follower objective that is different from yet significantly affects the … Read more

    A Branch-and-Price-and-Cut Algorithm for Discrete Network Design Problems Under Traffic Equilibrium

  • David
  • Michael Levin
    • Categories (Mixed) Integer Nonlinear Programming, Bilevel Optimization, Transportation Tags , , , ,

    This study addresses discrete network design problems under traffic equilibrium conditions or DNDPs. Given a network and a budget, DNDPs aim to model all-or-nothing decisions such as link addition to minimize network congestion effects. Congestion is measured using traffic equilibrium theory where link travel times are modeled as convex flow-dependent functions and where users make … Read more