Allotment problem in travel industry: A solution based on ASP

28Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the travel industry it is common for tour operators to pre-book from service suppliers blocks of package tours, which are called allotments in jargon. The selection of package tours is done according to several preference criteria aimed at maximizing the expected earnings given a budget. In this paper we formalize an allotment problem that abstracts the requirements of a real travel agent, and we solve it using Answer Set Programming. The obtained specification is executable, and it implements an advanced feature of the iTravel+ system.

Cite

CITATION STYLE

APA

Dodaro, C., Leone, N., Nardi, B., & Ricca, F. (2015). Allotment problem in travel industry: A solution based on ASP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9209, pp. 77–92). Springer Verlag. https://doi.org/10.1007/978-3-319-22002-4_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free