A genetic algorithm for solving dual-homing cell assignment problem of the two-level wireless ATM network
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1547 | en_US |
dc.citation.issue |
17 | en_US |
dc.citation.spage |
1536 | en_US |
dc.citation.volume |
25 | en_US |
dc.citation.woscount |
13 | |
dc.contributor.author |
Din, DR | en_US |
dc.contributor.author |
Tseng, SS | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:41:47Z | |
dc.date.available |
2014-12-08T15:41:47Z | |
dc.date.issued |
2002-11-01 | en_US |
dc.description.abstract |
In this paper, we investigate the optimal assignment problem, which assigns cells in Personal Communication Service to switches on Asynchronous Transfer Mode network in an optimum manner. The cost has two components: one is the cost of handoffs that involve two switches, and the other is the cost of cabling. This problem is model as dual-homing cell assignment problem, which is a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a stochastic search method, based on a genetic approach, is proposed to solve this problem. In this paper, domain-dependent heuristics are encoded into crossover operations, mutations of genetic algorithm (GA) to solve this problem. Simulation results show that GA is robust for this problem. (C) 2002 Elsevier Science B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/S0140-3664(02)00086-5 | en_US |
dc.identifier.issn |
0140-3664 | en_US |
dc.identifier.journal |
COMPUTER COMMUNICATIONS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/S0140-3664(02)00086-5 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/28414 | |
dc.identifier.wosnumber |
WOS:000178350900005 | |
dc.language.iso |
en_US | en_US |
dc.subject |
cell assignment | en_US |
dc.subject |
dual-homing | en_US |
dc.subject |
wireless ATM | en_US |
dc.subject |
genetic algorithm | en_US |
dc.subject |
design of algorithm | en_US |
dc.title |
A genetic algorithm for solving dual-homing cell assignment problem of the two-level wireless ATM network | en_US |
dc.type |
Article | en_US |
檔案
- 000178350900005.pdf (350.5 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Din, D., & Tseng, S. (2002). A genetic algorithm for solving dual-homing cell assignment problem of the two-level wireless ATM network. COMPUTER COMMUNICATIONS, 25(17), 1536–1547. https://doi.org/10.1016/S0140-3664(02)00086-5
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/28414