{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:32:25Z","timestamp":1761895945989,"version":"3.40.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,9,28]],"date-time":"2014-09-28T00:00:00Z","timestamp":1411862400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10489-014-0582-5","type":"journal-article","created":{"date-parts":[[2014,9,27]],"date-time":"2014-09-27T06:32:01Z","timestamp":1411799521000},"page":"1127-1149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A hybrid evolutionary approach to the registration area planning problem"],"prefix":"10.1007","volume":"41","author":[{"given":"Sachchida Nand","family":"Chaurasia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,28]]},"reference":[{"key":"582_CR1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1007\/s10489-013-0429-5","volume":"39","author":"R Abbasian","year":"2013","unstructured":"Abbasian R, Mouhoub M (2013) A hierarchical parallel genetic approach for the graph coloring problem. Appl Intell 39:510\u2013528","journal-title":"Appl Intell"},{"key":"582_CR2","doi-asserted-by":"crossref","unstructured":"Bejerano Y, Cidon I (1998) An efficient mobility management strategy for personal communication systems, In: Proceedings of the Fourth Annual International Conference on Mobile Computing and Networking, Dallas, TX","DOI":"10.1145\/288235.288295"},{"key":"582_CR3","doi-asserted-by":"crossref","unstructured":"Bejerano Y, Cidon I (2001) Efficient location management based on moving location areas. In: Proceedings of the 23rd Conference of the IEEE Communications Society, Anchorage, AK, Vol 1, pp 3\u201312","DOI":"10.1109\/INFCOM.2001.916681"},{"key":"582_CR4","doi-asserted-by":"crossref","unstructured":"Bejerano Y, Immorlica N, Naor J, Smith MA (2003) Efficient location area planning for personal communication systems, In: Proceedings of the Ninth Annual International Conference on Mobile Computing and Networking, San Diego, CA","DOI":"10.1145\/938985.938997"},{"key":"582_CR5","doi-asserted-by":"crossref","unstructured":"Bhattacharjee P S, Saha D, Maitra M (1999a) Location area planning for personal communication services networks, In: Proceedings of Second ACM International Workshop on Modeling, Analysis, and Simulation of Wireless and Mobile Systems, Seattle, WA","DOI":"10.1145\/313237.351161"},{"key":"582_CR6","doi-asserted-by":"crossref","unstructured":"Bhattacharjee P S, Saha D, Mukherjee A (1999b) Intelligent paging strategies for personal communication services network, In: Proceedings of the International Workshop on Data Engineering for Wireless and Mobile Access, Seattle, WA","DOI":"10.1145\/313300.313336"},{"issue":"4","key":"582_CR7","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1109\/TWC.2004.830821","volume":"3","author":"PS Bhattacharjee","year":"2004","unstructured":"Bhattacharjee PS, Saha D, Mukherjee A (2004) An approach for location area planning in a personal communication services network (PCSN). IEEE Trans Wirel Commun 3 (4):1176\u20131187","journal-title":"IEEE Trans Wirel Commun"},{"key":"582_CR8","unstructured":"Biesterfeld J, Jobmann K (1998) The use of prediction areas to improve mobility management algorithms, In: Proceedings of the International Conference on Telecommunications, Chaldiki, Vol 4"},{"issue":"16","key":"582_CR9","doi-asserted-by":"crossref","first-page":"3651","DOI":"10.1080\/00207540110068781","volume":"39","author":"EC Brown","year":"2001","unstructured":"Brown EC, Sumichrast RT (2001) CF-GGA: a grouping genetic algorithm for cell formation problem. Int J Prod Res 39 (16): 3651\u20133669","journal-title":"Int J Prod Res"},{"issue":"1","key":"582_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.engappai.2004.08.024","volume":"18","author":"EC Brown","year":"2005","unstructured":"Brown EC, Sumichrast RT (2005) Evaluating performance advantage of grouping genetic algorithms. Eng Appl Artif Intell 18 (1):1\u201312","journal-title":"Eng Appl Artif Intell"},{"key":"582_CR11","doi-asserted-by":"crossref","unstructured":"Burjorjee KM (2013) Explaining optimization in genetic algorithms with uniform crossover, In: Proceedings of the 2013 Conference on Foundations of Genetic Algorithms, ACM, Adelaide, Australia","DOI":"10.1145\/2460239.2460244"},{"key":"582_CR12","volume-title":"Handbook of Genetic Algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York"},{"key":"582_CR13","unstructured":"De Jong K, Spears W (1991) On the virtues of parameterized uniform crossover, In: Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kauman, San Mateo, USA"},{"key":"582_CR14","doi-asserted-by":"crossref","unstructured":"Demestichas P, Tzifa E, Demesticha V, Georgantas N, Kotsakis G, Kilanioti M, Striki M, Anagnostou M E, Theologou M E (1999) Control of the location update and paging signaling load in cellular systems by means of planning tools. In: Proceedings of the 50th Vehicular Technology Conference, Amsterdam, Vol 4","DOI":"10.1109\/VETECF.1999.797312"},{"key":"582_CR15","doi-asserted-by":"crossref","unstructured":"Demirkol I, Ersoy C, \u00c7a\u011flayan MU, Deli\u00e7 H D (2001) Location area planning in cellular networks using simulated annealing, In: Proceedings of the 23rd Conference of the IEEE Communications Society, Anchorage, AK, Vol 1","DOI":"10.1109\/INFCOM.2001.916682"},{"issue":"3","key":"582_CR16","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1109\/TWC.2004.827767","volume":"3","author":"I Demirkol","year":"2004","unstructured":"Demirkol I, Ersoy C, \u00c7a\u011flayan MU, Deli\u00e7 HD (2004) Location area planning and cell-to-switch assignment in cellular networks. IEEE Trans Wirel Commun 3 (3):880\u2013890","journal-title":"IEEE Trans Wirel Commun"},{"issue":"1","key":"582_CR17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1009638304510","volume":"4","author":"AE Eiben","year":"1998","unstructured":"Eiben AE, Van der Hauw JK, Van Hemert JI (1998) Graph coloring with adaptive evolutionary algorithms. J Heuristics 4 (1):25\u201346","journal-title":"J Heuristics"},{"key":"582_CR18","first-page":"79","volume":"33","author":"E Falkenauer","year":"1993","unstructured":"Falkenauer E (1993) The grouping genetic algorithms: widening the scope of the GAs. JORBEL : Belgaian J Oper Res, Stat Comput Sci 33:79\u2013102","journal-title":"JORBEL : Belgaian J Oper Res, Stat Comput Sci"},{"issue":"1","key":"582_CR19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heuristics 2(1):5\u201330","journal-title":"J Heuristics"},{"key":"582_CR20","doi-asserted-by":"crossref","unstructured":"Falkenauer E, Delchambre A (1992) A genetic algorithm for bin packing and line balancing. In: Proceedings of the IEEE 1992 International Conference on Robotics and Automation, Nice, France, Vol 2","DOI":"10.1109\/ROBOT.1992.220088"},{"key":"582_CR21","doi-asserted-by":"crossref","unstructured":"Gamst A (1991) Application of graph theoretical methods to GSM radio network planning. In: Proceedings of the IEEE Symposium on Circuits and Systems, Sydney, Australia, pp 942\u2013950","DOI":"10.1109\/ISCAS.1991.176519"},{"key":"582_CR22","volume-title":"Computers and intractability, a guide to the theory of NP completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP completeness. W.H. Freeman and company, New York"},{"key":"582_CR23","doi-asserted-by":"crossref","unstructured":"Gondim P R L (1996) Genetic algorithms and the location area partition problem in cellular networks. In: Proceedings of the IEEE 46th Vehicular Technology Conference, Atlanta, GA, Vol 3","DOI":"10.1109\/VETEC.1996.504075"},{"key":"582_CR24","first-page":"21","volume":"44","author":"C Hedible","year":"2003","unstructured":"Hedible C, Pierre S (2003) A genetic algorithm for assigning cells to switches in personal communication networks. IEEE Can Rev 44:21\u201324","journal-title":"IEEE Can Rev"},{"key":"582_CR25","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications in biology, control and artificial intelligence","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications in biology, control and artificial intelligence. University of Michigan Press, Ann Arbor, MI"},{"issue":"10","key":"582_CR26","doi-asserted-by":"crossref","first-page":"2180","DOI":"10.1016\/j.comcom.2007.04.018","volume":"30","author":"T James","year":"2007","unstructured":"James T, Vroblefski M, Nottingham Q (2007) A hybrid grouping genetic algorithm for the registration area planning problem. Comput commun 30(10):2180\u20132190","journal-title":"Comput commun"},{"key":"582_CR27","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.cie.2004.01.007","volume":"46","author":"VB Kreng","year":"2004","unstructured":"Kreng VB, Lee TP (2004) Modular product design with grouping genetic algorithm- a case study. Comput Ind Eng 46:443\u2013460","journal-title":"Comput Ind Eng"},{"key":"582_CR28","doi-asserted-by":"crossref","unstructured":"Kumar A, Umesh MN, Jha R (2000) Mobility modeling of rush hour traffic location area design in cellular networks. In: Proceedings of the Third ACM International Workshop on Wireless Mobile Multimedia, Bostan, MA","DOI":"10.1145\/345867.345883"},{"issue":"2","key":"582_CR29","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/175007.175012","volume":"4","author":"YB Lin","year":"1994","unstructured":"Lin YB, Mak VW (1994) Eliminating the boundary effect of a large-scale personal communication service network simulation. ACM Trans Model Comput Simul 4(2):165\u2013190","journal-title":"ACM Trans Model Comput Simul"},{"key":"582_CR30","unstructured":"Markoulidakis JG, Sykas ED (1993) Method for efficient location area planning in mobile telecommunications. In: Electronics Letters, Vol 29"},{"key":"582_CR31","doi-asserted-by":"crossref","unstructured":"Plehn J (1995) The design location areas in a gsm-network. In: Proceeding of the IEEE 45th Vehicular Technology Conference, Chicago, IL, Vol 2","DOI":"10.1109\/VETEC.1995.504993"},{"key":"582_CR32","unstructured":"Saraydar C, Rose C (1998) Location area design using population and traffic data. In: Proceedings of the 32nd Annual Conference on Information Science and System, Princeton, pp 739\u2013744"},{"issue":"6","key":"582_CR33","doi-asserted-by":"crossref","first-page":"1713","DOI":"10.1016\/j.cor.2004.11.026","volume":"33","author":"SJ Shyu","year":"2006","unstructured":"Shyu SJ, Lin B M T, Hsiao TS (2006) Ant colony optimization for the cell assignment problem in PCS networks. Comput & Oper Res 33(6):1713\u20131740","journal-title":"Comput & Oper Res"},{"key":"582_CR34","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/s00291-006-0071-2","volume":"29","author":"A Singh","year":"2007","unstructured":"Singh A, Gupta AK (2007) Two heuristic for the one-dimensional bin-packing problem. Oper Res Spectr 29:765\u2013781","journal-title":"Oper Res Spectr"},{"key":"582_CR35","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s10489-010-0248-x","volume":"36","author":"SM Soak","year":"2012","unstructured":"Soak SM, Lee SW (2012) A memetic algorithm for the quadratic multiple container packing problem. Appl Intell 36:119\u2013135","journal-title":"Appl Intell"},{"key":"582_CR36","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/s10489-008-0155-6","volume":"33","author":"SM Soak","year":"2010","unstructured":"Soak SM, Lee SW, Jeon M (2010) The improved adaptive link adjustment evolutionary algorithm for the multiple container packing problem. Appl Intell 33:144\u2013158","journal-title":"Appl Intell"},{"key":"582_CR37","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.omega.2004.10.005","volume":"34","author":"M Vroblefski","year":"2006","unstructured":"Vroblefski M, Brown EC (2006) A grouping genetic algorithm for registration area planning. Omega-Int J Manag Sci 34:220\u2013230","journal-title":"Omega-Int J Manag Sci"},{"key":"582_CR38","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1019155212541","volume":"5","author":"G Wan","year":"1999","unstructured":"Wan G, Lin E (1999) Cost reduction in location management using semi-realtime movement information. Wirel Netw 5:245\u2013256","journal-title":"Wirel Netw"},{"issue":"3","key":"582_CR39","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1109\/25.704853","volume":"43","author":"TP Wang","year":"1998","unstructured":"Wang TP, Hwang SY, Tseng CC (1998) Registration planning for PCS networks using genetic algorithms. IEEE Trans Veh Technol 43(3):987\u2013994","journal-title":"IEEE Trans Veh Technol"},{"key":"582_CR40","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1021885414968","volume":"9","author":"J Xu","year":"2003","unstructured":"Xu J, Lee DL, Li B (2003) On bandwidth allocation for data dissemination in cellular mobile networks. Wirel Netw 9:103\u2013116","journal-title":"Wirel Netw"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0582-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0582-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0582-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T21:53:57Z","timestamp":1746395637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0582-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,28]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["582"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0582-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2014,9,28]]}}}