Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)
- Volume 19 Issue 1
- /
- Pages.189-199
- /
- 1994
- /
- 1225-1119(pISSN)
- /
- 2733-4759(eISSN)
Optimal Design of a Covering Network
Abstract
This paper considers the covering network design problem (CNDP). In the CNDP, an undirected graph is given where nodes correspond to potential facility sites and arcs to potential links connecting facilities. The objective of the CNDP is to identify the least cost connected subgraph whose nodes cover the given demand points. The problem difines a demand point to be covered if some node in the selected graph is present within an appropriate distance from the demand point. We present an integer programming formulation for the problem and develop a dual-based solution procedure. The computational results for randomly generated test problems are also shown.
Keywords