back to menu
Simulated Annealing is a robust optimisation algorithm. We apply this technique to solve a minimum cost network synthesis problem, which is common in the design of telecommunication networks. The formulation we use models a number of practical problems with hop-limit, degree and capacity constraints. Our solution strategy consists of building and modifying a set of routes that form the network. Using this approach, we solve moderately large networks (up to 30 nodes) efficiently. Another important aspect of this work is the exploration of the method of application of local search transition operators to this problem.
|Title of host publication||APORS 2000: the fifth Conference of the Association of Asian-Pacific Operational Research Societies within IFORS|
|Editors||Paul Kang Hoh Phua, Chen Guan Wong, Dao Hua Ming, Wendy Koh|
|Place of Publication||Singapore|
|Publication status||Published - 2000|
Randall, M., McMahon, G., & Sugden, S. (2000). Using Simulated Annealing to Solve Telecommunication Design Problems. In P. K. Hoh Phua, C. G. Wong, D. H. Ming, & W. Koh (Eds.), APORS 2000: the fifth Conference of the Association of Asian-Pacific Operational Research Societies within IFORS [14-01] APORS Committee.