Ant colony optimization for the cell assignment problem in PCS networks

  • Authors:

  • Shxyong Jian Shyu;B. M. T. Lin;Tsung-Shen Hsiao

  • Affiliations:

  • Department of Computer Science and Information Engineering, Ming Chuan University, Tao-Yuan County, Taiwan, ROC;Department of Information and Finance Management, Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan, ROC;Department of Computer Science and Information Engineering, Ming Chuan University, Tao-Yuan County, Taiwan, ROC

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.