National Changhua University of Education Institutional Repository : Item 987654321/9927

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 30071124 Online Users : 593

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Engineering > Department and Graduate Institute of Computer Science and Information Engineering > Periodical Articles > Item 987654321/9927

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/9927

Title:	An Enhanced Simulated Annealing Algorithm for Solving the Cell Assignment Problem of the Two-Level Wireless ATM Network
Authors:	Din, Der-Rong;Tseng, S. S.
Contributors:	資訊工程系
Keywords:	Cell assignment;Design of algorithms;Graph partitioning;Simulated annealing;Wireless ATM
Date:	2004-06
Issue Date:	2012-04-30T04:31:26Z
Publisher:	CRL Publishing Ltd
Abstract:	In this paper, we investigate the problem of optimum assignment of cells in PCS (Personal Communication Service) to switches in an ATM (Asynchronous Transfer Mode) network. Given cells and switches in an ATM network (whose locations are fixed and known), the problem is grouping cells into clusters and assigning these clusters in an optimum manner. This problem is termed as cell assignment problem and modeled as a complex integer programming problem, and finding an optimal solution to this problem is NP-complete. Owing to the inability of simulated annealing (SA) to generate solutions that always satisfy all the constraints, the performance of a traditional-SA approach is not so promising. The SA technique is, however, easy to implement, requires little expert knowledge and is not memory intensive. Hence, in this paper, we attempt to develop an enhanced-SA approach for solving the cell assignment problem. The enhanced-SA constructs constraint-satisfying configurations and perturbation mechanism to ensure that the candidate configurations produced are feasible and satisfy all the constraints. The performance of the enhanced-SA algorithm is demonstrated through simulation. The result of the study is also compared with previous reported solution methods.
Relation:	Engineering Intelligent Systems Journal, 12(2): 111-125
Appears in Collections:	[Department and Graduate Institute of Computer Science and Information Engineering] Periodical Articles

Files in This Item:

File	Size	Format
2050400110003.pdf.pdf	14Kb	Adobe PDF	546	View/Open

Loading...