Document Type : Research Paper



In this research, we use Artificial Bee Colony (ABC) algorithm to
solve cell to switch assignment problem (CTSAP) that is NP-hard. In
CTSAP, there are cells and switches in which cells locations are
predetermined. The objective of problem is optimal assigning of cells
to switches with minimum cost. Here, we have two kinds of costs,
handoff and cabling costs. Call handling capacity for every switches
are given and equal. The model of our work is single homed that is
each cell must connect to only one switch. The mathematical model is
binary and nonlinear.
The program is coded by MATLAB 7.8.0 (R2009a). After estimating
parameters values of model, approving performance accuracy of code
and adjusting control parameters, the efficiency of algorithm by
determining experimental problems compared to Ant Colony
Optimization (ACO) that is one of the best for solving this problem.
Results show satisfactory performance of ABC algorithm


Salcedo-Sanz, Sancho; Jose, A. Portilla-Figueras; Emilio G. Ortiz-Garcia;
Angel M. Perez-Bellido; Christopher Thraves; Antonio Fernandez-Anta;
Xin Yao, Optimal switch location in mobile communication networks
using hybrid genetic algorithms. Applied Soft Computing, 8, 2008,
2. Merchant, Arif and Bhaskar Sengupta, Assignment of Cells to Switches
in PCS Networks. IEEE/ACM Transactions on networking, vol. 3, no. 5,
1995, 521-526.
3. Udgata, Siba K.; U. Anuradha; G. Pavan Kumar; Gauri K. Udgata.
Assignment of Cells to Switches in a Cellular Mobile Environment
using Swarm Intelligence. IEEE computer society, 2008, 189-194.
4. Quintero, Alejandro; Samuel Pierre, Assigning cells to switches in
cellular mobile networks: a comparative study. Computer
Communications, 26, 2003, 950-960.
5. Quintero, Alejandro; Samuel Pierre, Evolutionary approach to optimize
the assignment of cells to switches in personal communication
networks. Computer Communications, 26, 2003, 927-938.
6. Quintero, Alejandro; Samuel Pierre, Sequential and multi-population
memetic algorithms for assigning cells to switches in mobile networks.
Computer Networks, 43, 2003, 247-261.
7. Jian Shyu, Shxyong; B.M.T. Lin; Tsung-Shen Hsiao, Ant colony
optimization for the cell assignment problem in PCS networks.
Computers & Operations Research, 33, 2006, 1713-1740.
8. Pierre, Samuel; Fabien Houeto, A tabu search approach for assigning
cells to switches in cellular mobile networks. Computer
Communications, 25, 2002, 464-477.
9. Fournier, Joseph R.L.; Samuel Pierre, Assigning cells to switches in
mobile networks using an ant colony optimization heuristic. Computer
Communications, 28, 2005, 65-73.
10. Rajalakshmi, K.; Prakash Kumar; Hima M. Bindu, Hybridizing Iterative
Local Search Algorithm for Assigning Cells to Switch in Cellular
Mobile Network. International Journal of Soft Computing, 5(1), 2010, 7-
11. Salcedo-Sanz, Sancho; Xin Yao, Assignment of cells to switches in a
cellular mobile network using a hybrid Hopfield network-genetic
algorithm approach. Applied Soft Computing, 8, 2008, 216-224.
12. Panigrahi, Bijaya Ketan; Yuhui Shi; Meng-Hiot Lim, Handbook of
Swarm Intelligence. Springer-Verlag Berlin Heidelberg, 2011.
13. Karaboga, Dervis; Bahriye Akay, A comparative study of Artificial Bee
Colony algorithm. Applied Mathematics and Computation, 214, 2009,
14. Karaboga, Dervis; Celal Ozturk, A novel clustering approach: Artificial
Bee Colony (ABC) algorithm. Applied Soft Computing, 11, 2011, 652-