TY - GEN

T1 - Simulated annealing algorithm for solving network expanded problem in wireless ATM network

AU - Din, Der Rong

PY - 2007/1/1

Y1 - 2007/1/1

N2 - In this paper, the network expanded problem (NEP) which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) network to switches in an ATM (Asynchronous Transfer Mode) network is studied. In NEP, the locations of cells (or Base Stations, BSs) in PCS network are fixed and known, but new switches should be installed to ATM network and the topology of the backbone network may be changed. Given some potential sites of new switches, the problem is to determine how many switches should be added to the backbone network, the locations of new switches, the topology of the new backbone network, and the assignments of new adding and splitting cells in the PCS to switches of the new ATM backbone network in an optimal manner. The goal is to do the expansion in an attempt to minimize the total communication cost under budget and capacity constraints. The NEP is modelled as a complex integer programming problem. Since finding an optimal solution to this problem is Impractical. A simulated annealing (SA) algorithm is proposed to solve this problem. In the proposed SA, several heuristics are encoded into the perturbation to generate good solutions. Experimental results indicate that the proposed simulated annealing algorithm can get better performance than heuristic algorithm.

AB - In this paper, the network expanded problem (NEP) which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) network to switches in an ATM (Asynchronous Transfer Mode) network is studied. In NEP, the locations of cells (or Base Stations, BSs) in PCS network are fixed and known, but new switches should be installed to ATM network and the topology of the backbone network may be changed. Given some potential sites of new switches, the problem is to determine how many switches should be added to the backbone network, the locations of new switches, the topology of the new backbone network, and the assignments of new adding and splitting cells in the PCS to switches of the new ATM backbone network in an optimal manner. The goal is to do the expansion in an attempt to minimize the total communication cost under budget and capacity constraints. The NEP is modelled as a complex integer programming problem. Since finding an optimal solution to this problem is Impractical. A simulated annealing (SA) algorithm is proposed to solve this problem. In the proposed SA, several heuristics are encoded into the perturbation to generate good solutions. Experimental results indicate that the proposed simulated annealing algorithm can get better performance than heuristic algorithm.

UR - http://www.scopus.com/inward/record.url?scp=37249034223&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=37249034223&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-73325-6_114

DO - 10.1007/978-3-540-73325-6_114

M3 - Conference contribution

AN - SCOPUS:37249034223

SN - 9783540733225

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1138

EP - 1147

BT - New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings

PB - Springer Verlag

T2 - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE-2007

Y2 - 26 June 2007 through 29 June 2007

ER -