The Hierarchical Cycle Hub Location Problem

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.

EYDI ALIREZA; barzegar khaled

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

Journal Paper

Paper Information

Journal: Iranian Journal of Trade Studies Year:2019 | Volume:23 | Issue:89 Page(s): 155-176

Download Full-Text

Persian Verion

View:

708

Download:

Cites:

Information Journal Paper

Title

The Hierarchical Cycle Hub Location Problem

Author(s)

EYDI ALIREZA | barzegar khaled | Issue Writer Certificate

Keywords

Hub LocationQ1

Hierarchical NetworksQ1

Cycle In NetworkQ1

Mathematical ModelingQ1

Abstract

This paper presents the hierarchical cycle Hub Location problem. This new problem is an extension of the cycle Hub Location problem (CHLP). It is a three-layered hub network problem where the top level consists of a cycle network connecting the so-called central hubs and the second and third level are unions of star networks connecting the intermediate hubs to central hubs and the demand centers to intermediate and central hubs, respectively. The problem is to decide on the locations of a predetermined number of intermediate and central hubs and the connections in order to minimize the total routing cost in the resulting network. We also propose two mixed integer linear programming formulations for the problem. The behavior of the proposed models, in terms of solution time, is evaluated on the basis of an extensive computational study on Turkish pastal network dataset. The results achieved by CPLEX and Xpress solvers, based on the proposed MILP formulation, are compared to each other. We have also reduced the time to solve the problem by changing the parameters of the solver.

Cites

No record.

References

No record.

Cite

APA: Copy

EYDI, ALIREZA, & barzegar, khaled. (2019). The Hierarchical Cycle Hub Location Problem. IRANIAN JOURNAL OF TRADE STUDIES (IJTS), 23(89 ), 155-176. SID. https://sid.ir/paper/7473/en

Vancouver: Copy

EYDI ALIREZA, barzegar khaled. The Hierarchical Cycle Hub Location Problem. IRANIAN JOURNAL OF TRADE STUDIES (IJTS)[Internet]. 2019;23(89 ):155-176. Available from: https://sid.ir/paper/7473/en

IEEE: Copy

ALIREZA EYDI, and khaled barzegar, “The Hierarchical Cycle Hub Location Problem,” IRANIAN JOURNAL OF TRADE STUDIES (IJTS), vol. 23, no. 89 , pp. 155–176, 2019, [Online]. Available: https://sid.ir/paper/7473/en

Related Journal Papers