Computationally efficient algorithms for location area planning in future cellular systems

Demestichas, P; Tzifa, E; Demesticha, V; Striki, M; Kilanioti, M; Theologou, M

dc.contributor.author	Demestichas, P	en
dc.contributor.author	Georgantas, N	en
dc.contributor.author	Tzifa, E	en
dc.contributor.author	Demesticha, V	en
dc.contributor.author	Striki, M	en
dc.contributor.author	Kilanioti, M	en
dc.contributor.author	Theologou, M	en
dc.date.accessioned	2014-03-01T01:15:31Z
dc.date.available	2014-03-01T01:15:31Z
dc.date.issued	2000	en
dc.identifier.issn	0140-3664	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13560
dc.subject	simulated annealing	en
dc.subject	taboo search	en
dc.subject	genetic algorithm paradigm	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	UMTS	en
dc.title	Computationally efficient algorithms for location area planning in future cellular systems	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0140-3664(00)00194-8	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0140-3664(00)00194-8	en
heal.language	English	en
heal.publicationDate	2000	en
heal.abstract	Efficient resource utilisation in future cellular systems is related to the control of the signalling load imposed by the location update and paging operations, important means for controlling this load is the "proper" planning of location areas. In this paper we define and solve a version of the location area planning problem. Starting from a formal definition and an optimal formulation of the problem, three computationally efficient algorithms, adhering to simulated annealing, taboo search, and genetic algorithm paradigm, are presented. (C) 2000 Elsevier Science B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	COMPUTER COMMUNICATIONS	en
dc.identifier.doi	10.1016/S0140-3664(00)00194-8	en
dc.identifier.isi	ISI:000087737300005	en
dc.identifier.volume	23	en
dc.identifier.issue	13	en
dc.identifier.spage	1263	en
dc.identifier.epage	1280	en