A Lagrangean heuristic for the maximal covering location problem
| Autor: | Charles ReVelle, Roberto D. Galvão |
|---|---|
| Rok vydání: | 1996 |
| Předmět: |
Mathematical optimization
Information Systems and Management General Computer Science Duality gap Optimization algorithm Heuristic Substitution (algebra) Management Science and Operations Research Industrial and Manufacturing Engineering Vertex (geometry) Combinatorics Modeling and Simulation Heuristics Subgradient method Mathematics |
| Zdroj: | European Journal of Operational Research. 88:114-123 |
| ISSN: | 0377-2217 |
| Popis: | 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 was generally present at the end of the heuristic for the larger problems. The test problems were run in an IBM 3090-600J ‘super-computer’; the maximum computing time was kept below three minutes of CPU. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect