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

Authors:
Francisco de Assis Corrêa;Luiz Antonio Nogueira Lorena;Glaydston Mattos Ribeiro
Affiliations:
LAC - Computer and Applied Mathematics Laboratory, INPE - Brazilian Institute for Space Research, 12227-010 São José dos Campos, SP, Brazil;LAC - Computer and Applied Mathematics Laboratory, INPE - Brazilian Institute for Space Research, 12227-010 São José dos Campos, SP, Brazil;DECE - Department of Engineering and Exact Sciences, UFES - Federal University of Espírito Santo, 29933-415 São Mateus, ES, Brazil
Venue:
Computers and Operations Research
Year:
2009

Citing 8
Cited 2

Linear programming and network flows (2nd ed.)

Linear programming and network flows (2nd ed.)
The maximal covering location problem with capacities on total workload

Management Science
Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
Constructive Genetic Algorithm for Clustering Problems

Evolutionary Computation
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem

Computers and Operations Research
A branch-and-price approach to p-median location problems

Computers and Operations Research
Lagrangean relaxation with clusters for point-feature cartographic label placement problems

Computers and Operations Research
Population training heuristics

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization

Review: Generalized coverage: New developments in covering location models

Computers and Operations Research
Maximal covering location problem (MCLP) with fuzzy travel times

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

The maximal covering location problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering location-allocation with a constraint in waiting time or queue length for congested systems, with one or more servers per service center. This paper presents a solution procedure for that probabilistic model, considering one server per center, using a column generation and covering graph approaches. The computational tests report interesting results for network instances up to 818 vertices. The column generation results are competitive solving the instances in reasonable computational times, reaching optimality for some and providing good bounds for the difficult instances.