Modeling and Solving Single-Allocation p-Hub Maximal Covering Location Problem with Gradual Coverage

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.

MOEEN MOGHADAS F.; Roobin S.

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

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2019 | Volume:15 | Issue:4 (59) Page(s): 97-119

Download Full-Text

Persian Verion

View:

662

Download:

Cites:

Information Journal Paper

Title

Modeling and Solving Single-Allocation p-Hub Maximal Covering Location Problem with Gradual Coverage

Author(s)

MOEEN MOGHADAS F. | Roobin S. | Issue Writer Certificate

Keywords

Hub Maximal Covering Location ProblemQ1

Gradual CoverageQ1

Lagrangean RelaxationQ1

Heuristic AlgorithmQ1

Genetic AlgorithmQ2

Abstract

P-Hub Maximal Covering Location Problem is one of the most commonly used location-allocation problems. In this problem, the goal is to determine the best location for the hubs such that the covered demand is maximized by considering the predefined coverage radius. In classical hub problems, if the distance between the origin and destination is less than this radius, coverage is possible; otherwise the demand between the two points will not be covered. In this paper, the problem of p-hub maximal covering is investigated with Gradual Coverage. First, the concept of Gradual Coverage and its developed functions is examined and then, a new mathematical model is presented for the problem. Also, in order to calculate the appropriate upper bound for the problem, the Lagrangian relaxation method is used and a heuristic method and a Genetic Algorithm are used to solve it. Finally, the results of using these methods are compared with the results of GAMS software. This comparison shows that the new model presented for Gradual Coverage and the new covering parameter have more suitable results in comparison with the coverage model and function in the literature of the subject. Also, applying Lagrangian relaxation will provide a suitable upper bound for the problem. The heuristic method yields better computational results in less time, and the Genetic Algorithm provides more coverage with less computational time compared to solving examples with the GAMS software, especially for larger test instances.

Cites

No record.

References

No record.

Cite

APA: Copy

MOEEN MOGHADAS, F., & Roobin, S.. (2019). Modeling and Solving Single-Allocation p-Hub Maximal Covering Location Problem with Gradual Coverage. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 15(4 (59) ), 97-119. SID. https://sid.ir/paper/164488/en

Vancouver: Copy

MOEEN MOGHADAS F., Roobin S.. Modeling and Solving Single-Allocation p-Hub Maximal Covering Location Problem with Gradual Coverage. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2019;15(4 (59) ):97-119. Available from: https://sid.ir/paper/164488/en

IEEE: Copy

F. MOEEN MOGHADAS, and S. Roobin, “Modeling and Solving Single-Allocation p-Hub Maximal Covering Location Problem with Gradual Coverage,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 15, no. 4 (59) , pp. 97–119, 2019, [Online]. Available: https://sid.ir/paper/164488/en

Related Journal Papers