A Lagrangean heuristic for the maximal covering location problem

We develop a Lagrangean heuristic for the maximal covering location problem. Upper bounds are given by a vertex addition and substitution heuristic and lower bounds are produced through a subgradient optimization algorithm. The procedure was tested in networks of up to 150 vertices. A duality gap wa...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 1996-01, Vol.88 (1), p.114-123
Hauptverfasser:	Galvão, Roberto Diéguez, ReVelle, Charles
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Heuristic Heuristics Hierarchies Lagrangean relaxation Mathematical programming Maximal covering location problem Operations research Optimization Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!