Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
The node capacitated graph partitioning problem: a computational study
Mathematical Programming: Series A and B - Special issue on computational integer programming
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization
INFORMS Journal on Computing
A Hybrid Heuristic for the p-Median Problem
Journal of Heuristics
GRASP with Path Relinking for Three-Index Assignment
INFORMS Journal on Computing
A reactive GRASP with path relinking for capacitated clustering
Journal of Heuristics
Journal of Combinatorial Optimization
Biased random-key genetic algorithms for combinatorial optimization
Journal of Heuristics
GRASP with path-relinking for the generalized quadratic assignment problem
Journal of Heuristics
Path-relinking intensification methods for stochastic local search algorithms
Journal of Heuristics
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
IEEE Communications Surveys & Tutorials
Handover and channel assignment in mobile cellular networks
IEEE Communications Magazine
Cliques and clustering: A combinatorial approach
Operations Research Letters
A probabilistic heuristic for a computationally difficult set covering problem
Operations Research Letters
Hi-index | 0.00 |
A mobile device connects to the cell tower (base station) from which it receives the strongest signal. As the device moves it may connect to a series of towers. The process in which the device changes the base station it is connected to is called handover. A cell tower is connected to a radio network controller (RNC) which controls many of its operations, including handover. Each cell tower handles an amount of traffic and each radio network controller has capacity to handle a maximum amount of traffic from all base stations connected to it. Handovers between base stations connected to different RNCs tend to fail more often than handovers between base stations connected to the same RNC. Handover failures result in dropped connections and therefore should be minimized. The Handover Minimization Problem is to assign towers to RNCs such that RNC capacity is not violated and the number of handovers between base stations connected to different RNCs is minimized. We describe an integer programming formulation for the handover minimization problem and show that state-of-the-art integer programming solvers can solve only very small instances of the problem. We propose several randomized heuristics for finding approximate solutions of this problem, including a GRASP with path-relinking for the generalized quadratic assignment problem, a GRASP with evolutionary path-relinking, and a biased random-key genetic algorithm. Computational results are presented.