Miriam Ganz

The Multi-Stop Station Location Problem: Exact Approaches

  • Erik Mühmer
  • Miriam Ganz
  • Marco E. Lübbecke
  • Felix J. L. Willamowski
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms, Transportation Tags , ,

    The multi-stop station location problem (MSLP) aims to place stations such that a set of trips is feasible with respect to length bounds while minimizing cost. Each trip consists of a sequence of stops that must be visited in a given order, and a length bound that controls the maximum length that is possible without … Read more

    The Multi-Stop Station Location Problem

  • Miriam Ganz
  • Erik Mühmer
  • Felix J. L. Willamowski
    • Categories Approximation Algorithms, Network Optimization, Transportation Tags , , , ,

    We introduce the (directed) multi-stop station location problem. The goal is to install stations such that ordered (multi-)sets of stops can be traversed with respect to range restrictions that are reset whenever a station is visited. Applications arise in telecommunications and transportation, e.g., charging station placement problems. The problem generalizes several network optimization problems such … Read more