IDEAS home Printed from https://ideas.repec.org/a/ids/injams/v8y2016i1p20-37.html
   My bibliography  Save this article

A bi-objective airline revenue management problem with possible cancellation

Author

Listed:
  • Mohammad Vardi
  • Ali Salmasnia
  • Ali Ghorbanian
  • Hadi Mokhtari

Abstract

The optimal allocation of seat inventory is a well-known problem of airline revenue management in the airline industry. It is usually carried out among fare classes with a known demand distribution for each class with the aim at increasing the efficiency of revenue systems and enhancing customer satisfaction. Furthermore, an important assumption is the issue of cancellation which is very common in the field of airlines. So to avoid having unused seat in a flight, overbooking technique is used. During last years, different approaches have been proposed for addressing this problem, but most of them only considered revenue to be maximised. In this paper, an optimisation approach based on Taguchi design of experiment and COPRAS decision-making method is proposed. The suggested method not only maximises total revenue and customer satisfaction simultaneously, but also mitigates the effects of nuisance factors on system by minimising the variance of two objectives. Experimental results on a standard example show the effectiveness of the proposed method.

Suggested Citation

  • Mohammad Vardi & Ali Salmasnia & Ali Ghorbanian & Hadi Mokhtari, 2016. "A bi-objective airline revenue management problem with possible cancellation," International Journal of Applied Management Science, Inderscience Enterprises Ltd, vol. 8(1), pages 20-37.
    • Handle: RePEc:ids:injams:v:8:y:2016:i:1:p:20-37
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=75456
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kalyan Talluri & Garrett van Ryzin, 1999. "A Randomized Linear Programming Method for Computing Network Bid Prices," Transportation Science, INFORMS, vol. 33(2), pages 207-216, May.
    2. Meissner, Joern & Strauss, Arne, 2012. "Network revenue management with inventory-sensitive bid prices and customer choice," European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
    3. Opricovic, Serafim & Tzeng, Gwo-Hshiung, 2007. "Extended VIKOR method in comparison with outranking methods," European Journal of Operational Research, Elsevier, vol. 178(2), pages 514-529, April.
    4. Kalyan Talluri & Garrett van Ryzin, 1998. "An Analysis of Bid-Price Controls for Network Revenue Management," Management Science, INFORMS, vol. 44(11-Part-1), pages 1577-1593, November.
    5. Gao, Jiti & Lu, Zudi & Tjostheim, Dag, 2003. "Semiparametric spatial regression: theory and practice," MPRA Paper 11991, University Library of Munich, Germany, revised Oct 2006.
    6. Graf, M. & Kimms, A., 2011. "An option-based revenue management procedure for strategic airline alliances," European Journal of Operational Research, Elsevier, vol. 215(2), pages 459-469, December.
    7. Klein, Robert & Petrick, Anita, 2003. "Revenue Management : eine weitere Erfolgsstory des Operations Research," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 20672, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    8. Topaloglu, Huseyin, 2009. "On the asymptotic optimality of the randomized linear program for network revenue management," European Journal of Operational Research, Elsevier, vol. 197(3), pages 884-896, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ali Salmasnia & Hamid Daliri & Ali Ghorbanian & Hadi Mokhtari, 2018. "A statistical analysis and simulation based approach to an uncertain supplier selection problem with discount option," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(6), pages 1250-1259, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nicolas Houy & François Le Grand, 2015. "The Monte Carlo first-come-first-served heuristic for network revenue management," Working Papers halshs-01155698, HAL.
    2. Chaoxu Tong & Huseyin Topaloglu, 2014. "On the Approximate Linear Programming Approach for Network Revenue Management Problems," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 121-134, February.
    3. Gönsch, Jochen & Koch, Sebastian & Steinhardt, Claudius, 2014. "Revenue management with flexible products: The value of flexibility and its incorporation into DLP-based approaches," International Journal of Production Economics, Elsevier, vol. 153(C), pages 280-294.
    4. Andris Möller & Werner Römisch & Klaus Weber, 2008. "Airline network revenue management by multistage stochastic programming," Computational Management Science, Springer, vol. 5(4), pages 355-377, October.
    5. Meissner, Joern & Strauss, Arne, 2012. "Improved bid prices for choice-based network revenue management," European Journal of Operational Research, Elsevier, vol. 217(2), pages 417-427.
    6. Nicolas Houy & François Le Grand, 2015. "Financing and advising with (over)confident entrepreneurs : an experimental investigation," Working Papers 1514, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
    7. Kimms, Alf & Çetiner, Demet, 2012. "Approximate nucleolus-based revenue sharing in airline alliances," European Journal of Operational Research, Elsevier, vol. 220(2), pages 510-521.
    8. Syed Asif Raza & Rafi Ashrafi & Ali Akgunduz, 2020. "A bibliometric analysis of revenue management in airline industry," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 19(6), pages 436-465, December.
    9. Chan Seng Pun & Diego Klabjan & Fikri Karaesmen & Sergey Shebalov, 2016. "Itinerary-based nesting control with upsell," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 15(2), pages 107-137, April.
    10. Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
    11. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2005. "Decision Support for Consumer Direct Grocery Initiatives," Transportation Science, INFORMS, vol. 39(3), pages 313-327, August.
    12. E. Andrew Boyd & Ioana C. Bilegan, 2003. "Revenue Management and E-Commerce," Management Science, INFORMS, vol. 49(10), pages 1363-1386, October.
    13. Yuhang Ma & Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals," Operations Research, INFORMS, vol. 68(3), pages 834-855, May.
    14. Georgia Perakis & Guillaume Roels, 2010. "Robust Controls for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 12(1), pages 56-76, November.
    15. Kalyan Talluri & Garrett van Ryzin, 2000. "Revenue management under general discrete choice model of consumer behavior," Economics Working Papers 533, Department of Economics and Business, Universitat Pompeu Fabra, revised Oct 2001.
    16. L. F. Escudero & J. F. Monge & D. Romero Morales & J. Wang, 2013. "Expected Future Value Decomposition Based Bid Price Generation for Large-Scale Network Revenue Management," Transportation Science, INFORMS, vol. 47(2), pages 181-197, May.
    17. Nurşen Aydın & Ş. İlker Birbil & Hüseyin Topaloğlu, 2017. "Delayed Purchase Options in Single-Leg Revenue Management," Transportation Science, INFORMS, vol. 51(4), pages 1031-1045, November.
    18. Mika Sumida & Huseyin Topaloglu, 2019. "An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 83-99, February.
    19. Huseyin Topaloglu & S. Ilker Birbil & J. B. G. Frenk & Nilay Noyan, 2012. "Tractable Open Loop Policies for Joint Overbooking and Capacity Control Over a Single Flight Leg with Multiple Fare Classes," Transportation Science, INFORMS, vol. 46(4), pages 460-481, November.
    20. Joern Meissner & Arne Strauss & Kalyan Talluri, 2011. "An Enhanced Concave Program Relaxation for Choice Network Revenue Management," Working Papers MRG/0020, Department of Management Science, Lancaster University, revised Jan 2011.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:injams:v:8:y:2016:i:1:p:20-37. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=286 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.