Abstract
In this paper, a simulated annealing algorithm is proposed and studied in order to find good feasible solution for the global topology planning problem of Universal Mobile Telecommunications System (UMTS) networks. The latter has been shown to be NP-hard as it is composed of three different subproblems (each one being NP-hard): the cell planning problem, the access network planning problem and the core network planning problem. As a result, we concentrate our effort on the development of an approximate algorithm based on simulated annealing. Numerical results show that quasi-optimal solutions (on average, within 5.26% of the optimal solution) can be found with a relatively short computation time compared to CPLEX.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
