Home > Research > Publications & Outputs > The multimode covering location problem

Research

Associated organisational units

Electronic data

  • I_submission_COR

    Rights statement: This is the author’s version of a work that was accepted for publication in Computers and Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers and Operations Research, 67, 2016 DOI: 10.1016/j.cor.2015.09.003

    Accepted author manuscript, 218 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

Keywords

View graph of relations

The multimode covering location problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published
Close
More...
<mark>Journal publication date</mark>03/2016
<mark>Journal</mark>Computers and Operations Research
Volume67
Number of pages9
Pages (from-to)25–33
Publication StatusPublished
Early online date21/09/15
<mark>Original language</mark>English

Abstract

In this paper we introduce the Multimode Covering Location Problem. This is a generalization of the Maximal Covering Location Problem that consists in locating a given number of facilities of different types with a limitation on the number of facilities sharing the same site.

The problem is challenging and intrinsically much harder than its basic version. Nevertheless, it admits a constant factor approximation guarantee, which can be achieved combining two greedy algorithms. To improve the greedy solutions, we have developed a Variable Neighborhood Search approach, based on an exponential-size neighborhood. This algorithm computes good quality solutions in short computational time. The viability of the approach here proposed is also corroborated by a comparison with a Heuristic Concentration algorithm, which is presently the most effective approach to solve large instances of the Maximal Covering Location Problem.

Bibliographic note

This is the author’s version of a work that was accepted for publication in Computers and Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers and Operations Research, 67, 2016 DOI: 10.1016/j.cor.2015.09.003