scholarly journals An Alternative Approach using Genetic Algorithm Based Heuristics for Capacitated Maximal Covering Location Allocation Problem

2014 ◽  
pp. 36-48
Author(s):  
S. Sarifah Radiah Shariff ◽  
Noor Hasnah Moin ◽  
Mohd Omar
Keyword(s):  
Genetic Algorithm ◽  
Allocation Problem ◽  
Location Allocation ◽  
Maximal Covering ◽  
Alternative Approach ◽  
Location Allocation Problem

scholarly journals Hybrid heuristics for the probabilistic maximal covering location-allocation problem

2007 ◽  
Vol 7 (3) ◽  
pp. 323-343 ◽  
Author(s):  
Francisco de Assis Corrêa ◽  
Antonio Augusto Chaves ◽  
Luiz Antonio Nogueira Lorena
Keyword(s):  
Allocation Problem ◽  
Location Allocation ◽  
Maximal Covering ◽  
Hybrid Heuristics ◽  
Location Allocation Problem

Capacitated Maximal Covering Location Allocation Problem During Flood Disaster

2017 ◽  
Vol 23 (11) ◽  
pp. 11545-11548 ◽  
Author(s):  
Noridayu Mah Hashim ◽  
S. Sarifah Radiah Shariff ◽  
Sayang Mohd Deni
Keyword(s):  
Flood Disaster ◽  
Allocation Problem ◽  
Location Allocation ◽  
Maximal Covering ◽  
Location Allocation Problem

A decomposition approach for the probabilistic maximal covering location-allocation problem

2009 ◽  
Vol 36 (10) ◽  
pp. 2729-2739 ◽  
Author(s):  
Francisco de Assis Corrêa ◽  
Luiz Antonio Nogueira Lorena ◽  
Glaydston Mattos Ribeiro
Keyword(s):  
Allocation Problem ◽  
Decomposition Approach ◽  
Location Allocation ◽  
Maximal Covering ◽  
Location Allocation Problem

scholarly journals Queueing Maximal Covering Location-Allocation Problem: An Extension with M/G/1 Queueing Systems

2011 ◽  
Vol 2011 ◽  
pp. 1-13
Author(s):  
Foroogh Moeen Moghadas ◽  
Hossein Taghizadeh Kakhki
Keyword(s):  
Quadratic Programming ◽  
Queueing System ◽  
Queueing Systems ◽  
Solution Procedure ◽  
Allocation Problem ◽  
Computational Results ◽  
Heuristic Procedure ◽  
Location Allocation ◽  
Maximal Covering ◽  
Location Allocation Problem

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/G/1 queueing system. We first formulate the problem as a binary quadratic programming problem and then propose a new solution procedure based on decomposition of the problem into smaller binary quadratic sub-problems. The heuristic procedure GRASP is used to solve the sub-problems, as well as the entire model. Some computational results are also presented.

A hybrid method for the Probabilistic Maximal Covering Location–Allocation Problem

2015 ◽  
Vol 57 ◽  
pp. 51-59 ◽  
Author(s):  
Marcos A. Pereira ◽  
Leandro C. Coelho ◽  
Luiz A.N. Lorena ◽  
Ligia C. de Souza
Keyword(s):  
Hybrid Method ◽  
Allocation Problem ◽  
Location Allocation ◽  
Maximal Covering ◽  
Location Allocation Problem
Sign in / Sign up

Export Citation Format

Share Document