Skip to Main Content
ASME Press Select Proceedings

International Conference on Mechanical and Electrical Technology, 3rd, (ICMET-China 2011), Volumes 1–3

By
Yi Xie
Yi Xie
Search for other works by this author on:
ISBN:
9780791859810
No. of Pages:
906
Publisher:
ASME Press
Publication date:
2011

This paper studies the use of meta-heuristic search algorithm Simulated Annealing for solving a minimum cost Network Synthesis Problem which is common in the design of telecommunication networks and considers a set of practical constraints including arc capacity, node capacity, node degree and hop limit. We propose an improved neighborhood structure based on dynamically building routes between O-D pairs. The advantage of this neighborhood structure is that precomputed traffic routes are unnecessary and the traffic flow can be dynamically allocated amongst these routes. The experimental results show the effectiveness and efficiency of the new algorithm and the ability of it to solve larger scale problems.

This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal