Integer Programming Formulation of Finding Cheapest Ticket Combination over Multiple Tourist Attractions

Moonyoung Kang ()
Additional contact information
Moonyoung Kang: Raytheon BBN Technologies

A chapter in Information and Communication Technologies in Tourism 2013, 2013, pp 131-143 from Springer

Abstract: Abstract 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.

Keywords: Ticket optimization; Trip planner; Trip optimization (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-3-642-36309-2_12

Ordering information: This item can be ordered from
http://www.springer.com/9783642363092

DOI: 10.1007/978-3-642-36309-2_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().