Processing, Please wait...

  • Home
  • About Us
  • Search:
  • Advanced Search

Growing Science » International Journal of Industrial Engineering Computations » The capacitated maximal covering location problem with heterogeneous facilities and vehicles and different setup costs: An effective heuristic approach

Journals

  • IJIEC (747)
  • MSL (2643)
  • DSL (668)
  • CCL (508)
  • USCM (1092)
  • ESM (413)
  • AC (562)
  • JPM (271)
  • IJDS (912)
  • JFS (91)
  • HE (32)
  • SCI (26)

IJIEC Volumes

    • Volume 1 (17)
      • Issue 1 (9)
      • Issue 2 (8)
    • Volume 2 (68)
      • Issue 1 (12)
      • Issue 2 (20)
      • Issue 3 (20)
      • Issue 4 (16)
    • Volume 3 (76)
      • Issue 1 (9)
      • Issue 2 (15)
      • Issue 3 (20)
      • Issue 4 (12)
      • Issue 5 (20)
    • Volume 4 (50)
      • Issue 1 (14)
      • Issue 2 (10)
      • Issue 3 (12)
      • Issue 4 (14)
    • Volume 5 (47)
      • Issue 1 (13)
      • Issue 2 (12)
      • Issue 3 (12)
      • Issue 4 (10)
    • Volume 6 (39)
      • Issue 1 (7)
      • Issue 2 (12)
      • Issue 3 (10)
      • Issue 4 (10)
    • Volume 7 (47)
      • Issue 1 (10)
      • Issue 2 (14)
      • Issue 3 (10)
      • Issue 4 (13)
    • Volume 8 (30)
      • Issue 1 (9)
      • Issue 2 (7)
      • Issue 3 (8)
      • Issue 4 (6)
    • Volume 9 (32)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (7)
      • Issue 4 (10)
    • Volume 10 (34)
      • Issue 1 (8)
      • Issue 2 (10)
      • Issue 3 (8)
      • Issue 4 (8)
    • Volume 11 (36)
      • Issue 1 (9)
      • Issue 2 (8)
      • Issue 3 (9)
      • Issue 4 (10)
    • Volume 12 (29)
      • Issue 1 (9)
      • Issue 2 (6)
      • Issue 3 (8)
      • Issue 4 (6)
    • Volume 13 (41)
      • Issue 1 (10)
      • Issue 2 (8)
      • Issue 3 (10)
      • Issue 4 (13)
    • Volume 14 (50)
      • Issue 1 (11)
      • Issue 2 (15)
      • Issue 3 (9)
      • Issue 4 (15)
    • Volume 15 (55)
      • Issue 1 (19)
      • Issue 2 (15)
      • Issue 3 (12)
      • Issue 4 (9)
    • Volume 16 (75)
      • Issue 1 (12)
      • Issue 2 (15)
      • Issue 3 (19)
      • Issue 4 (29)
    • Volume 17 (21)
      • Issue 1 (21)

Keywords

Supply chain management(166)
Jordan(161)
Vietnam(149)
Customer satisfaction(120)
Performance(113)
Supply chain(110)
Service quality(98)
Competitive advantage(95)
Tehran Stock Exchange(94)
SMEs(87)
optimization(86)
Financial performance(83)
Trust(83)
TOPSIS(83)
Sustainability(81)
Job satisfaction(80)
Factor analysis(78)
Social media(78)
Knowledge Management(77)
Artificial intelligence(77)


» Show all keywords

Authors

Naser Azad(82)
Mohammad Reza Iravani(64)
Zeplin Jiwa Husada Tarigan(63)
Endri Endri(45)
Muhammad Alshurideh(42)
Hotlan Siagian(39)
Jumadil Saputra(36)
Dmaithan Almajali(36)
Muhammad Turki Alshurideh(35)
Barween Al Kurdi(32)
Ahmad Makui(32)
Basrowi Basrowi(31)
Hassan Ghodrati(31)
Mohammad Khodaei Valahzaghard(30)
Sautma Ronni Basana(29)
Shankar Chakraborty(29)
Ni Nyoman Kerti Yasa(29)
Sulieman Ibraheem Shelash Al-Hawary(28)
Prasadja Ricardianto(28)
Haitham M. Alzoubi(27)


» Show all authors

Countries

Iran(2183)
Indonesia(1290)
India(787)
Jordan(786)
Vietnam(504)
Saudi Arabia(453)
Malaysia(441)
United Arab Emirates(220)
China(206)
Thailand(153)
United States(111)
Turkey(106)
Ukraine(104)
Egypt(98)
Canada(92)
Peru(88)
Pakistan(85)
United Kingdom(80)
Morocco(79)
Nigeria(78)


» Show all countries

International Journal of Industrial Engineering Computations

ISSN 1923-2934 (Online) - ISSN 1923-2926 (Print)
Quarterly Publication
Volume 12 Issue 1 pp. 79-90 , 2021

The capacitated maximal covering location problem with heterogeneous facilities and vehicles and different setup costs: An effective heuristic approach Pages 79-90 Right click to download the paper Download PDF

Authors: Masoud Hatami Gazani, Seyed Armin Akhavan Niaki, Seyed Taghi Akhavan Niaki

DOI: 10.5267/j.ijiec.2020.9.002

Keywords: Facility location, Covering problem, Maximal covering location problem, Heuristic algorithm, Genetic algorithm

Abstract: In this research, a maximal covering location problem (MCLP) with real-world constraints such as multiple types of facilities and vehicles with different setup costs is taken into account. An original mixed integer linear programming (MILP) model is constructed in order to find the optimal solution. Since the problem at hand is shown to be NP-hard, a constructive heuristic method and a meta-heuristic approach based on genetic algorithm (GA) are developed to solve the problem. To find the most effective solution technique, a set of problems of different sizes is randomly generated and solved by the proposed solution methods. Computational results demonstrate that the heuristic method is capable of producing optimal or near-optimal solutions in a rational execution time.

How to cite this paper
Gazani, M., Niaki, S & Niaki, S. (2021). The capacitated maximal covering location problem with heterogeneous facilities and vehicles and different setup costs: An effective heuristic approach.International Journal of Industrial Engineering Computations , 12(1), 79-90.

Refrences
Al-Aomar, R. (2006). Incorporating robustness into genetic algorithm search of stochastic simulation outputs. Simulation Modelling Practice and Theory, 14(3), 201-223.
Atta, S., Mahapatra, P., Mukhopadhyay, A. (2018). Solving maximal covering location problem using genetic algorithm with local refinement. Soft Computing, 22(12), 3891–3906.
Alexandris, G., Giannikos, I. (2010). A new model for maximal coverage exploiting GIS capabilities. European Journal of Operational Research, 202(2), 328-338.
Bagherinejad, J., Shoeib, M. (2018). Dynamic capacitated maximal covering location problem by considering dynamic capacity. International Journal of Industrial Engineering Computations, 9(2), 249-264.
Beldar, P., Costa, A. (2018). Single machine batch processing problem with release dates to minimize total completion time. International Journal of Industrial Engineering Computations, 9(3), 331-348.
Berman, O., Kalcsics, J., Krass, D. (2016). On covering location problems on networks with edge demand. Computers & Operations Research, 74, 214-227.
Church, R., Velle, C. (1974). The maximal covering location problem. Papers of the Regional Science Association, 32(1), 101-118.
Current, J., Storbeck, J. (1988). Capacitated covering models. Environment and Planning B: Planning and Design., 15, 153–163.
Current, J., O'Kelly, M. (1992). Locating Emergency Warning Sirens. Decision Sciences, 23(1), 221-234.
Curtin, K., Hayslett-McCall, K., Qiu, F. (2010). Determining optimal police patrol areas with maximal covering and backup covering location models. Networks and Spatial Economics, 10(1), 125–145.
ElKady, S., Abdelsalam, H. (2016). A modified particle swarm optimization algorithm for solving capacitated maximal covering location problem in healthcare systems. In A.-E. Hassanien, C. Grosan, & M. Tolb, Applications of Intelligent Optimization in Biology and Medicine (p. 307). Cham: Springer International Publishing.
Erdemir, E., Batta, R., Rogerson, P., Blatt, A., Flanigan, M. (2010). Joint ground and air emergency medical services coverage models: A greedy heuristic solution approach. European Journal of Operational Research, 207(2), 736-749.
Griffin, P., Scherrer, C., Swann, J. (2008). Optimization of community health center locations and service offerings with statistical need estimation. IIE Transactions, 40(9), 880-892.
Haghani, A. (1996). Capacitated maximum covering location models: Formulations and solution procedures. Journal of Advanced Transportation, 30(3), 101-136.
Hansheng, L., Lishan, K. (1999). Balance between exploration and exploitation in genetic search. Wuhan University Journal of Natural Sciences, 4(1), 28–32.
Hoff, A., Andersson, H., Christiansen, M., Hasle, G., Løkketangen, A. (2010). Industrial aspects and literature survey: Fleet composition and routing. Computers & Operations Research, 37(12), 2041-2061.
Holland, J. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor, MI: The University of Michigan Press.
Jia, H., Ordóñez, F., Dessouky, M. (2007). Solution approaches for facility location of medical supplies for large-scale emergencies. Computers & Industrial Engineering, 52(2), 257-276.
Karasakal, O., Karasakal, E. (2004). A maximal covering location model in the presence of partial coverage. Computers & Operations Research, 31(9), 1515-1526.
Lee, G., Murray, A. (2010). Maximal covering with network survivability requirements in wireless mesh networks. Computers, Environment and Urban Systems, 34(1), 49-57.
Megiddo, N., Zemel, E., Hakimi, S. (1983). The maximum coverage location problem. SIAM Journal on Algebraic and Discrete Methods, 4(2), 253–261.
Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs. Berlin: Springer-Verlag Berlin Heidelberg.
Oztekin, A., Pajouh, F., Delen, D., Swim, L. (2010). An RFID network design methodology for asset tracking in healthcare. Decision Support Systems, 49(1), 100-109.
Phadke, M. (1989). Quality Engineering Using Robust Design. Upper Saddle River: Prentice Hall.
Pham, D., & Karaboga, D. (2000). Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks. London: Springer-Verlag London.
Pirkul, H., Schilling, D. (1989). The capacitated maximal covering location problem with backup service. Annals of Operations Research, 18(1), 141–154.
Salari, M. (2014). An iterated local search for the budget constrained generalized maximal covering location problem. Journal of Mathematical Modelling and Algorithms in Operations Research, 13(3), 301–313.
Schilling, D., Jayarman, V., Barkhi, R. (1993). A review of covering problem in facility location. Location Science, 1, 25-55.
Shariff, S., Moin, N., Omar, M. (2012). Location allocation modeling for healthcare facility planning in Malaysia. Computers & Industrial Engineering, 62(4), 1000-1010.
Shariff, S., Moin, N., Omar, M. (2010). An alternative approach using genetic algorithm based heuristics for capacitated maximal covering location allocation problem. Operations and Supply Chain Management, 3(1), 36-48.
Sivanandam, S., Deepa, S. (2008). Introduction to Genetic Algorithms. Berlin: Springer-Verlag Berlin Heidelberg.
Talbi, E.-G. (2009). Metaheuristics: From Design to Implementation. New Jersey: John Wiley & Sons.
Toregas, C., Swain, R., ReVelle, C. (1971). The Location of Emergency Service Facilities. Operations Research, 19(6), 1363-1373.
Yin, P., Mu, L. (2012). Modular capacitated maximal covering location problem for the optimal siting of emergency vehicles. Applied Geography, 34, 247-254.
Zanjirani Farahani, R., Asgari, N., Heidari, N., Hosseininia, M., Goh, M. (2012). Covering problems in facility location: A review. Computers & Industrial Engineering, 62(1), 368-407.
Zarandi, M., Davari, S., Sisakht, S. (2011). The large scale maximal covering location problem. Scientia Iranica, 18(6), 1564-1570.
Zhang, B., Peng, J., Li, S. (2017). Covering location problem of emergency service facilities in an uncertain environment. Applied Mathematical Modelling, 51, 429-447.

  • 17
  • 1
  • 2
  • 3
  • 4
  • 5

Journal: International Journal of Industrial Engineering Computations | Year: 2021 | Volume: 12 | Issue: 1 | Views: 2248 | Reviews: 0

Related Articles:
  • Designing a hub covering location problem under uncertainty conditions
  • Dynamic capacitated maximal covering location problem by considering dynami ...
  • MCLP and SQM models for the emergency vehicle districting and location prob ...
  • A multi-objective set covering problem: A case study of warehouse allocatio ...
  • A Simulated Annealing method to solve a generalized maximal covering locati ...

Add Reviews

Name:*
E-Mail:
Review:
Bold Italic Underline Strike | Align left Center Align right | Insert smilies Insert link URLInsert protected URL Select color | Add Hidden Text Insert Quote Convert selected text from selection to Cyrillic (Russian) alphabet Insert spoiler
winkwinkedsmileam
belayfeelfellowlaughing
lollovenorecourse
requestsadtonguewassat
cryingwhatbullyangry
Security Code: *
Include security image CAPCHA.
Refresh Code

® 2010-2026 GrowingScience.Com