| Article ID: | iaor20002374 |
| Country: | Canada |
| Volume: | 37 |
| Issue: | 3 |
| Start Page Number: | 271 |
| End Page Number: | 296 |
| Publication Date: | Aug 1999 |
| Journal: | INFOR |
| Authors: | Bourjolly Jean-Marie, Tomiuk Daniel, Kapantow Gene H.M. |
| Keywords: | planning, communications |
The network design problems studied in this paper are typically known in the Telecommunications literature as the Concentrator Location, Terminal Assignment and Terminal Layout Problems. These are versions of well-known Operations Research models such as Capacitated Location, Capacitated Assignment, Capacitated Minimum Spanning Tree, and Vehicle Routing. We describe two Simulated Annealing algorithms for solving them and analyze the results obtained through computational testing.