Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/7471
Title: A dynamic approach to frequent flyer program
Authors: Veeraraghavan, R.
Kashyap, R.
Chopde, A.
Bhattacharya, S.
Issue Date: 2014
Citation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, Vol.8402 LNCS, , pp.271-279
Abstract: The frequent flyer algorithms adopted are static in nature, that is the points awarded to a frequent flyer is proportional only to the miles traveled. In static approach, there is neither an incentive for the frequent flyer to travel more (increase profitability) nor does it ensure customer satisfaction. In this paper, we propose a dynamic approach that considers time varying factors such as competition from rival airliners, number of travels made so far, load factor etc and prove that it can not only improve profitability but at the same time ensure customer satisfaction. � 2014 Springer International Publishing Switzerland.
URI: http://idr.nitk.ac.in/jspui/handle/123456789/7471
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.