Volume 15, Issue 4 (1-2019)                   jor 2019, 15(4): 97-119 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Moeen Moghadas F, Roobin S. Modeling and Solving Single-Allocation p-Hub Maximal Covering Location Problem with Gradual Coverage. jor 2019; 15 (4) :97-119
URL: http://jamlu.liau.ac.ir/article-1-1613-en.html
Department of Mathematics, University of Bojnord, Bojnord, Iran
Abstract:   (2970 Views)
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.
 
Full-Text [PDF 1686 kb]   (984 Downloads)    
Type of Study: Research | Subject: Special
Received: 2017/12/25 | Accepted: 2018/08/29 | Published: 2019/01/15

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.