ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Location Area Planning Using Simulated Annealing With A New Solution Representation

Kim, Ki-Dong and Kim, Sung Soo and Byeon, Eui-Seok and Kim, Il-Hwan and Mani, V and Moon, Jae-Ki and Jang, Si-Hwan (2012) Location Area Planning Using Simulated Annealing With A New Solution Representation. In: International Journal of Innovative Computing, Information and Control, 8 (3A). pp. 1635-1644.

[img] PDF
Location.pdf - Published Version
Restricted to Registered users only

Download (35Kb) | Request a copy

Abstract

Location area planning problem is to partition the cellular/mobile network into location areas with the objective of minimizing the total cost. This partitioning problem is a difficult combinatorial optimization problem. In this paper, we use the simulated annealing with a new solution representation. In our method, we can automatically generate different number of location areas using Compact Index (CI) to obtain the optimal/best partitions. We compare the results obtained in our method with the earlier results available in literature. We show that our methodology is able to perform better than earlier methods.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to ICIC International.
Keywords: Location management;Simulated annealing;Location area planning;Compact index
Department/Centre: Division of Mechanical Sciences > Aerospace Engineering (Formerly, Aeronautical Engineering)
Date Deposited: 20 Apr 2012 12:41
Last Modified: 20 Apr 2012 12:41
URI: http://eprints.iisc.ernet.in/id/eprint/44254

Actions (login required)

View Item View Item