A robust optimization approach for itinerary planning with deadline

The authors propose a robust optimization approach to address the itinerary planning problem with deadline in public transit networks. Given departure times at origins and deadlines at destinations, they help the travelers meet the deadlines as much as possible. Their model maximizes the size of the uncertainty set of arc travel times, while guaranteeing that the corresponding worst-case arrival time of itinerary would not exceed the deadline. The authors exploit the model’s structure and develop efficient solution algorithms. They demonstrate in numerical studies that their approach can effectively mitigate the lateness and can solve real-world instances within one second.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01670466
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Apr 20 2018 3:44PM