A dynamic approach to frequent flyer program

Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/7471

Full metadata record

DC Field	Value	Language
dc.contributor.author	Veeraraghavan, R.
dc.contributor.author	Kashyap, R.
dc.contributor.author	Chopde, A.
dc.contributor.author	Bhattacharya, S.
dc.date.accessioned	2020-03-30T09:59:11Z	-
dc.date.available	2020-03-30T09:59:11Z	-
dc.date.issued	2014
dc.identifier.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	en_US
dc.identifier.uri	http://idr.nitk.ac.in/jspui/handle/123456789/7471	-
dc.description.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.	en_US
dc.title	A dynamic approach to frequent flyer program	en_US
dc.type	Book chapter	en_US
Appears in Collections:	2. Conference Papers

Files in This Item:

There are no files associated with this item.