THE SINGLE ALLOCATION HUB COVERING LOCATION PROBLEM ON STAR NETWORK, MODELING, LINEARIZATION AND FINDING A SUITABLE BOUND FOR IT

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.

SAJADI S.; MOEEN MOGHADAS F.; KARIMI H.

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

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2018 | Volume:15 | Issue:1 (56) Page(s): 79-102

Download Full-Text

Persian Verion

View:

839

Download:

Cites:

Information Journal Paper

Title

THE SINGLE ALLOCATION HUB COVERING LOCATION PROBLEM ON STAR NETWORK, MODELING, LINEARIZATION AND FINDING A SUITABLE BOUND FOR IT

Author(s)

SAJADI S. | MOEEN MOGHADAS F. | KARIMI H. | Issue Writer Certificate

Keywords

HUB COVERING LOCATION PROBLEMQ1

P-HUB MAXIMAL COVERING LOCATION PROBLEMQ1

STAR NETWORKQ1

LINEARIZATIONQ1

LAGRANGEAN RELAXATIONQ1

Abstract

The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locations and allocation of each customer to at most one hub as total transferred demand between customers be maximum. The purpose of the second problem is minimizing the sum of constant costs of construction of hubs and flow transfer costs between the network nodes as complete covering is created in the network. In the two problems, connection of customers to hub centers and connection of hubs to the central hub is as the source to destination distance by considering discount factor to connect hub and central hub lower or equal to the predefined value. After presenting the math model in two problems, LINEARIZATION is performed, and then Lagrange liberation is applied to find the right boundaries. In addition, in the second problem, valid inequalities equal to two constraints of problem are presented. Finally, the results of solution of linear, non-linear models, and using Lagrange liberation are evaluated and compared. The evaluation of these results on CAB data set shows that the linear models are better than non-linear models in terms of optimal value of objective function and implementation time. Based on the results, the bounds of Lagrange liberation are closer to the optimal solution of problems.

Cites

No record.

References

No record.

Cite

APA: Copy

SAJADI, S., MOEEN MOGHADAS, F., & KARIMI, H.. (2018). THE SINGLE ALLOCATION HUB COVERING LOCATION PROBLEM ON STAR NETWORK, MODELING, LINEARIZATION AND FINDING A SUITABLE BOUND FOR IT. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 15(1 (56) ), 79-102. SID. https://sid.ir/paper/164587/en

Vancouver: Copy

SAJADI S., MOEEN MOGHADAS F., KARIMI H.. THE SINGLE ALLOCATION HUB COVERING LOCATION PROBLEM ON STAR NETWORK, MODELING, LINEARIZATION AND FINDING A SUITABLE BOUND FOR IT. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2018;15(1 (56) ):79-102. Available from: https://sid.ir/paper/164587/en

IEEE: Copy

S. SAJADI, F. MOEEN MOGHADAS, and H. KARIMI, “THE SINGLE ALLOCATION HUB COVERING LOCATION PROBLEM ON STAR NETWORK, MODELING, LINEARIZATION AND FINDING A SUITABLE BOUND FOR IT,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 15, no. 1 (56) , pp. 79–102, 2018, [Online]. Available: https://sid.ir/paper/164587/en

Related Journal Papers