Integer Programming Formulation of Finding Cheapest Ticket Combination over Multiple Tourist Attractions
Tourist attractions often provide multiple ticket options, such as student tickets, group tickets, inter-attraction combo tickets, free admission on a certain date, and etc. With these various ticket options, finding the cheapest but feasible ticket combination covering all tourist attractions a traveller plans to visit may not be trivial. This paper describes how we convert a cheapest ticket combination problem into a mathematically well-defined set cover problem and solves it through integer linear programming in practical amount of time. We tested our system with various admission tickets in New York City, one of the largest tourist destinations.
KeywordsTicket optimization Trip planner Trip optimization
Unable to display preview. Download preview PDF.
- Balas, E & Padberg, M. W. (1972). On the Set-Covering Problem. Operations Research Dijkstra, Edsger W. (1965). Cooperating sequential processes (EWD-123). E.W. Dijkstra Archive. Center for American History, University of Texas at Austin. Google Scholar
- Grimaldi, R. P. (1998). Discrete and Combinatorial Mathematics: An Applied Introduction. 4th edn.ISBN 0-201-19912-2. pp. 244–248.Google Scholar
- Vazirani, Vijay V. (2001), Approximation AlgorithmsGoogle Scholar
- Yu, G. & Arguello, M. F. (1999). Optimization Engine for Flight Assignment, Scheduling, and Routing of Aircraft in response to irregular operation. U.S. Patent 6,314,361 Google Scholar