Ant colony optimization for the cell assignment problem in PCS networks
檔案
- 000234338400013.pdf (1,008.3 KB, Adobe PDF)
日期
2006-06-01
類型
期刊名稱
COMPUTERS & OPERATIONS RESEARCH
卷期與頁次
第 33 卷第 6 期,頁 1713–1740
ISSN
0305-0548
語言
英文
摘要
Even though significant improvement to communications infrastructure has been attained in the personal communication service industry, the issues concerning the assignment of cells to switches in order to minimize the cabling and handoff costs in a reasonable time remain challenging and need to be solved. In this paper, we propose an algorithm based upon the Ant Colony Optimization (ACO) approach to solve the cell assignment problem, which is known to be NP-hard. ACO is a metaheuristic inspired by the foraging behavior of ant colonies. We model the cell assignment problem as a form of matching problem in a weighted directed bipartite graph so that our artificial ants can construct paths that correspond to feasible solutions on the graph. We explore and analyze the behavior of the ants by examining the computational results of our ACO algorithm under different parameter settings. The performances of the ACO algorithm and several heuristics and metaheuristics known in the literature are also empirically studied. Experimental results demonstrate that the proposed ACO algorithm is an effective and competitive approach in composing fairly satisfactory results with respect to solution quality and execution time for the cell assignment problem as compared with most existing heuristics or metaheuristics. (c) 2005 Elsevier Ltd. All rights reserved.
所屬典藏
期刊論文引用此條目
Shyu, S., Lin, B., & Hsiao, T. (2006). Ant colony optimization for the cell assignment problem in PCS networks. COMPUTERS & OPERATIONS RESEARCH, 33(6), 1713–1740. https://doi.org/10.1016/j.cor.2004.11.026
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/12199