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.

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

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

The Multiperiod Location-Allocation Problem with Relocation of Facilities

1975 ◽  
Vol 22 (1) ◽  
pp. 57-65 ◽  
Author(s):  
George O. Wesolowsky ◽  
William G. Truscott
Keyword(s):  
Allocation Problem ◽  
Location Allocation ◽  
Location Allocation Problem

scholarly journals Car Scrap Yards Network in Slovakia

ECONOMICS ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 51-59
Author(s):  
Juraj Pekár ◽  
Ivan Brezina ◽  
Zuzana Čičková
Keyword(s):  
Allocation Problem ◽  
Specific Location ◽  
Location Allocation ◽  
Minimum Numbers ◽  
Location Allocation Problem

Abstract The paper is focused on specific location-allocation problem aimed to determine a set of scrap yards for vehicle decommissioning in Slovakia. The goal is to determine scrap yards network so that it is not prohibitive to pass old car for dismantling and further processing wherever former owner lives. Two approaches are considered. Once we consider the case when it is necessary to construct a completely new network of scrap yards, which results to setting of their minimum numbers and also their location. In the latter case, the already existing network of scrap yards is considered, while the model provides its extension, in order to achieve the desired values of accessibility for all residents. The results were applied to an existing network of scrap yards identifying locations to build new scrap yards. Areas where whole new network of scrap yards must be built were also identified.

Sign in / Sign up

Export Citation Format

Share Document