Using Simulated Annealing to Solve Telecommunication Design Problems

Marcus Randall, Graham McMahon, Stephen Sugden

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

3 Downloads (Pure)

Abstract


back to menu


Abstract

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.
Original languageEnglish
Title of host publicationAPORS 2000: the fifth Conference of the Association of Asian-Pacific Operational Research Societies within IFORS
EditorsPaul Kang Hoh Phua, Chen Guan Wong, Dao Hua Ming, Wendy Koh
Place of PublicationSingapore
PublisherAPORS Committee
Publication statusPublished - 2000

Fingerprint Dive into the research topics of 'Using Simulated Annealing to Solve Telecommunication Design Problems'. Together they form a unique fingerprint.

  • Cite this

    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] Singapore: APORS Committee.