A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks

DOI10.1016/J.EJOR.2006.01.039zbMath1107.90324OpenAlexW1988054449MaRDI QIDQ859942

Chun-Hyun Paik, Samit Soni

Publication date: 22 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.01.039

zbMATH Keywords

simulated annealingcellular networkspaginglocation updates

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A cutting plane algorithm for a clustering problem
• A systematic procedure for setting parameters in simulated annealing algorithms
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Location-area partition in a cellular radio network
• Equation of State Calculations by Fast Computing Machines
• Effective paging schemes with delay bounds as QoS constraints in wireless systems

This page was built for publication: A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks