EconPapers    
Economics at your fingertips  
 

Strategic airline network design problem in a duopolistic market

Ta-Hui Yang, Ching-Hui Tang and Hung-Chun Hsiao

Transportation Planning and Technology, 2020, vol. 43, issue 6, 586-601

Abstract: This paper addresses a competitive airline hub-and-spoke network design problem in a duopolistic market with sequential airline entry. Two airlines, a leader and a follower, enter the market sequentially to make decisions about their own flight networks. Each must consider their opponent’s reactions and respond to each other’s decisions in making their own, leading to interactive competition between them. A bi-level model is proposed to formulate the behaviors and decisions of the two airlines. In addition, an interactive solution procedure based on a genetic algorithm (GA) is developed to repeatedly solve the upper and lower level models. Finally, we generate a numerical example based on the regional air market in Taiwan and China. The results provide useful insights and highlight the importance of considering interactive competition for airlines when designing their flight networks.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03081060.2020.1780709 (text/html)
Access to full text is restricted to subscribers.

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:taf:transp:v:43:y:2020:i:6:p:586-601

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/GTPT20

DOI: 10.1080/03081060.2020.1780709

Access Statistics for this article

Transportation Planning and Technology is currently edited by Dr. David Gillingwater

More articles in Transportation Planning and Technology from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().

 
Page updated 2025-03-20
Handle: RePEc:taf:transp:v:43:y:2020:i:6:p:586-601