Robust cooperative maximal covering location problem: a case study of the locating Tele-Taxi stations in Tabriz, Iran

2018 ◽  
Vol 29 (2) ◽  
pp. 163 ◽  
Author(s):  
Hassan Rezazadeh ◽  
Salim Moghtased Azar ◽  
Meysam Shafiei Kisomi ◽  
Rouhollah Bagheri
Keyword(s):  
Location Problem ◽  
Maximal Covering

scholarly journals Hybrid Set Covering and Dynamic Modular Covering Location Problem: Application to an Emergency Humanitarian Logistics Problem

2020 ◽  
Vol 10 (20) ◽  
pp. 7110 ◽  
Author(s):  
Roghayyeh Alizadeh ◽  
Tatsushi Nishi
Keyword(s):  
Location Problem ◽  
Set Covering ◽  
Strategic Decisions ◽  
Maximal Covering ◽  
Planning Decisions ◽  
Tactical Decisions ◽  
Covering Model ◽  
Validation Tests ◽  
Capacitated Facilities

This paper presents an extension of the covering location problem as a hybrid covering model that utilizes the set covering and maximal covering location problems. The developed model is a multi-period model that considers strategic and tactical planning decisions. Hybrid covering location problem (HCLP) determines the location of the capacitated facilities by using dynamic set covering location problem as strategic decisions and assigns the constructive units of facilities and allocates the demand points by using dynamic modular capacitated maximal covering location problem as tactical decisions. One of the applications of the proposed model is locating first aid centers in humanitarian logistic services that have been addressed by studying a threat case study in Japan. In addition to validating the developed model, it has been compared to other possible combined problems, and several randomly generated examples have been solved. The results of the case study and model validation tests approve that the main hybrid developed model (HCLP) is capable of providing better coverage percentage compared to conventional covering models and other hybrid variants.

Robust cooperative maximal covering location problem: a case study of the locating Tele-Taxi stations in Tabriz, Iran

2018 ◽  
Vol 29 (2) ◽  
pp. 163
Author(s):  
Rouhollah Bagheri ◽  
Meysam Shafiei Kisomi ◽  
Hassan Rezazadeh ◽  
Salim Moghtased Azar
Keyword(s):  
Location Problem ◽  
Maximal Covering

Research on Maintenance Force Location Model

2012 ◽  
Vol 268-270 ◽  
pp. 2054-2057
Author(s):  
Chang Zheng Qu ◽  
Hong Qiang Gu ◽  
Lu Gao
Keyword(s):  
Location Problem ◽  
Lagrangean Relaxation ◽  
Location Model ◽  
Relaxation Algorithm ◽  
Maximal Covering ◽  
Model Based ◽  
Set Up ◽  
Priority Function

To optimize to allocation of maintenance force in warfare, this paper extended the application of the maximal covering location problem. As the priority function being defined, a maximal covering location model based on the priority of requirement nodes was set up and a lagrangean relaxation algorithm was applied to solve the problem. A case study was given at last, which verified the model.

scholarly journals The large scale maximal covering location problem

2011 ◽  
Vol 18 (6) ◽  
pp. 1564-1570 ◽  
Author(s):  
M.H. Fazel Zarandi ◽  
S. Davari ◽  
S.A. Haddad Sisakht
Keyword(s):  
Large Scale ◽  
Location Problem ◽  
Maximal Covering
Sign in / Sign up

Export Citation Format

Share Document