Integer Programming Formulation of Finding Cheapest Ticket Combination over Multiple Tourist Attractions
- Cite this paper as:
- Kang M. (2013) Integer Programming Formulation of Finding Cheapest Ticket Combination over Multiple Tourist Attractions. In: Cantoni L., Xiang Z. (eds) Information and Communication Technologies in Tourism 2013. Springer, Berlin, Heidelberg
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.