A Probabilistic Mathematical Programming model for Locating Virtual Hubs in Airline Transportation Network under a M/M/C/K Queuing Model

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Shiripour Saber

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Transportation Engineering Year:2022 | Volume:13 | Issue:3 Page(s): 1841-1815

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

A Probabilistic Mathematical Programming model for Locating Virtual Hubs in Airline Transportation Network under a M/M/C/K Queuing Model

Author(s)

Shiripour Saber | Issue Writer Certificate

Keywords

Dynamic virtual hub location problem

airline transportation network

robust optimization model

scenario-based demand

M/M/C/K queuing model

Abstract

In this study, a probabilistic mathematical programming model for locating virtual hubs in an airline transportation network in a dynamic environment and taking into account the capacity constraints for the original and virtual hubs is considered. The aim is to determine the optimal locations for establishment of the virtual hubs from among the candidate locations and design an optimal virtual hub network for allocation of the demand flow between the nodes to each hub along the planning horizon, so that the sum of transportation costs on different routes and the virtual hub location costs, along the planning horizon is minimized. In here, capacity constraints are applied to the model using an M/M/C/K queue model. Also, the demand at the relevant nodes are considered nondeterministic and scenario-based. The proposed problem is formulated as a nonlinear robust optimization mathematical programming model and solved by the LINGO optimization software. The effectiveness of the proposed model and its sensitivity to various parameters are investigated using a well-known CAB data set.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans