A robust optimization approach for itinerary planning with deadline

Yu Zhang and Jiafu Tang

Transportation Research Part E: Logistics and Transportation Review, 2018, vol. 113, issue C, 56-74

Abstract: We 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, we help the travelers meet the deadlines as much as possible. Our 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. We exploit the model’s structure and develop efficient solution algorithms. We demonstrate in numerical studies that our approach can effectively mitigate the lateness and can solve real-world instances within one second.

Keywords: Robust optimization; Itinerary planning; Deadline; Public transit network (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554517306452
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:113:y:2018:i:c:p:56-74

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

DOI: 10.1016/j.tre.2018.01.016

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().