National Changhua University of Education Institutional Repository : Item 987654321/9935
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6491/11663
造访人次 : 24929041      在线人数 : 73
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻


题名: Simulated Annealing Algorithm for Solving Network Expanded Problem in Wireless ATM Network
作者: Din, Der-Rong
贡献者: 資訊工程系
日期: 2007-06
上传时间: 2012-04-30T04:32:27Z
出版者: Springer
摘要: 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.
關聯: Lecture Notes in Artificial Intelligence (LNAI), 4570: 1138-1147
显示于类别:[資訊工程學系] 期刊論文


档案 大小格式浏览次数



DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈