Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
Ant-based load balancing in telecommunications networks
Adaptive Behavior
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
Ant algorithms for discrete optimization
Artificial Life
An Ants heuristic for the frequency assignment problem
Future Generation Computer Systems
Foundations of Mobile Radio Engineering
Foundations of Mobile Radio Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
INFORMS Journal on Computing
Mobile Agents for Adaptive Routing
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Ant colony optimization for resource-constrained project scheduling
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Assigning cells to switches in cellular mobile networks using taboosearch
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A tabu search approach for assigning cells to switches in cellular mobile networks
Computer Communications
Assigning cells to switches in mobile networks using an ant colony optimization heuristic
Computer Communications
PCS mobility support over fixed ATM networks
IEEE Communications Magazine
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Improved assignment with ant colony optimization for multi-target tracking
Expert Systems with Applications: An International Journal
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Information Sciences: an International Journal
A sociologically inspired heuristic for optimization algorithms: A case study on ant systems
Expert Systems with Applications: An International Journal
International Journal of Business Data Communications and Networking
Concave minimum cost network flow problems solved with a colony of ants
Journal of Heuristics
Hi-index | 0.01 |
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.