Using Simulated Annealing to Solve Telecommunication Design Problems

Marcus Randall; Graham McMahon; Stephen Sugden

Using Simulated Annealing to Solve Telecommunication Design Problems

Marcus Randall, Graham McMahon, Stephen Sugden

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

111 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 language	English
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
Publisher	APORS Committee
Publication status	Published - 2000

Access to Document

Using Simulated Annealing to Solve Telecommunication Network Design ProblemsFinal published version, 60.4 KB

Cite this

@inproceedings{b5f5900039e34a649176cc186c64ea30,

title = "Using Simulated Annealing to Solve Telecommunication Design Problems",

abstract = "back to menuAbstractSimulated 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.",

author = "Marcus Randall and Graham McMahon and Stephen Sugden",

year = "2000",

language = "English",

editor = "{Hoh Phua}, {Paul Kang} and Wong, {Chen Guan} and Ming, {Dao Hua} and Wendy Koh",

booktitle = "APORS 2000: the fifth Conference of the Association of Asian-Pacific Operational Research Societies within IFORS",

publisher = "APORS Committee",

}

Using Simulated Annealing to Solve Telecommunication Design Problems. / Randall, Marcus; McMahon, Graham; Sugden, Stephen.
APORS 2000: the fifth Conference of the Association of Asian-Pacific Operational Research Societies within IFORS. ed. / Paul Kang Hoh Phua; Chen Guan Wong; Dao Hua Ming; Wendy Koh. Singapore: APORS Committee, 2000. 14-01.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

TY - GEN

T1 - Using Simulated Annealing to Solve Telecommunication Design Problems

AU - Randall, Marcus

AU - McMahon, Graham

AU - Sugden, Stephen

PY - 2000

Y1 - 2000

N2 - back to menuAbstractSimulated 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.

AB - back to menuAbstractSimulated 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.

M3 - Conference contribution

BT - APORS 2000: the fifth Conference of the Association of Asian-Pacific Operational Research Societies within IFORS

A2 - Hoh Phua, Paul Kang

A2 - Wong, Chen Guan

A2 - Ming, Dao Hua

A2 - Koh, Wendy

PB - APORS Committee

CY - Singapore

ER -

Using Simulated Annealing to Solve Telecommunication Design Problems

Abstract

Access to Document

Fingerprint

Cite this