A Decomposition Heuristic for the Maximal Covering Location Problem

This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facili...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Advances in Operations Research Ročník 2010; číslo 2010; s. 2 - 13
Hlavní autoři: Senne, Edson Luiz França, Pereira, Marcos Antonio, Lorena, Luiz Antonio Nogueira
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cairo, Egypt Hindawi Limiteds 01.01.2010
Hindawi Puplishing Corporation
Hindawi Publishing Corporation
John Wiley & Sons, Inc
Témata:
Algorithms
Applied mathematics
Clusters
Covering
Decomposition
Emergency services
Graphs
Heuristic
Joining
Lagrangian functions
Linear programming
Location problems (Programming)
Mathematical analysis
Operations research
Optimization
Partitions (Mathematics)
Position (location)
Programming (Mathematics)
Studies
الخوارزميات
بحوث العمليات
ISSN:1687-9147, 1687-9155
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, are identified and relaxed in the Lagrangean way, resulting in disconnected subgraphs representing smaller subproblems that are computationally easier to solve by exact methods. The proposed technique is compared to the classical approach, using real data and instances from the available literature.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1687-9147
1687-9155
DOI:10.1155/2010/120756