att_abstract={{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.}},
	att_categories={C_CCF.7, C_CCF.8, C_NSS.9, C_NSS.18},
	att_copyright_notice={{The definitive version was published in   2013. {{, Volume 19}}{{, Issue 6}}{{, 2013-06-30}}{{, 10.1007/s10732-013-9223-0}}
	att_tags={Mobility networks,  handover minimization,  randomized heuristics,  GRASP,  biased random-key genetic algorithm},
	author={Mauricio Resende and L.F. Morán-Mirabal, Tecnológico de Monterrey and J.L. González-Velarde, Tecnológico de Monterrey and R.M.A. Silva, Fed. U. of Pernambuco},
	institution={{Journal of Heuristics}},
	title={{Randomized heuristics for handover minimization in mobility networks}},