Chance-constrained programming and robust optimization approaches for uncertain hub location problems in a cooperative competitive environment

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

In this paper, an integer programming model is o ered for capacitated multi-allocation median hub location problems applicable to both cooperative and competitive environments among airlines. We divided the hubs into six independent categories by comparing the parameters of ticket price, travel time, and service quality for both the follower and leader airlines. The degrees of importance for the parameters of time and cost were determined by a multivariate Lagrange interpolation method, which could be of signi cant help in allocating travelers to the follower airline hubs. Then, with regard to the seasonal demand of travelers, travel demand was considered as an uncertain parameter. To identify the deterministic equivalent forms for the considered categories of hub location models, the robust optimization method and the chance-constrained programming model were employed. Finally, the developed model was tested for a case study. The results indicated that the coalition of follower airlines could absorb nearly 2% of the leader airline travelers with relatively lower travel cost and time.

Cite

CITATION STYLE

APA

Nourzadeh, F., Ebrahimnejad, S., Khalili-Damghani, K., & Hafezalkotob, A. (2022). Chance-constrained programming and robust optimization approaches for uncertain hub location problems in a cooperative competitive environment. Scientia Iranica, 29(4), 2149–2165. https://doi.org/10.24200/sci.2020.54072.3573

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