{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T14:52:07Z","timestamp":1781103127973,"version":"3.54.1"},"reference-count":46,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,4,1]]},"abstract":"<p>Artificial Bee Colony (ABC) is an optimization algorithm that simulates the foraging behavior of honey bees. It is a population based search technique whose performance depends largely on the distribution of initial population. Generally, uniform distributions are preferred since they best reflect the lack of knowledge about the optimum\u2019s location. Moreover, these are easy to generate as most of the programming languages have an inbuilt function for generating uniformly distributed random numbers. However, in case of a population dependent optimization algorithm like that of ABC, random numbers having uniform probability distribution may not be a good choice as they may not be able exploit the search space fully. This paper uses quasi random numbers based on Halton sequence for the initial distribution and have compared the simulation results with initial population generated using uniform distribution. The proposed variant, termed as Halton based ABC (H-ABC), is validated on a set of 15 standard benchmark problems, 6 nontraditional shifted benchmark functions proposed at the special session of CEC2008, and has been used for solving the real life problem of estimating the cost model parameters. Numerical results indicate the competence of the proposed algorithm.<\/p>","DOI":"10.4018\/jncr.2012040105","type":"journal-article","created":{"date-parts":[[2012,12,5]],"date-time":"2012-12-05T18:06:31Z","timestamp":1354730791000},"page":"86-106","source":"Crossref","is-referenced-by-count":2,"title":["Halton Based Initial Distribution in Artificial Bee Colony Algorithm and its Application in Software Effort Estimation"],"prefix":"10.4018","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9043-8641","authenticated-orcid":true,"given":"Tarun Kumar","family":"Sharma","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Roorkee, Saharanpur Campus, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Millie","family":"Pant","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Roorkee, Saharanpur Campus, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jncr.2012040105-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.07.015"},{"key":"jncr.2012040105-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.02.042"},{"key":"jncr.2012040105-2","unstructured":"Bailey, J. W., & Basili, V. R. (1981). A meta model for software development resource expenditure. In Proceedings of the International Conference on Software Engineering (pp. 107-115)."},{"key":"jncr.2012040105-3","first-page":"113","author":"A.Baykasoglu","year":"2007","journal-title":"Swarm intelligence focus on ant and particle swarm optimization, artificial bee colony algorithm and its application to generalized assignment problem"},{"key":"jncr.2012040105-4","unstructured":"Bharti. (1994). Controlled random search technique and their applications (Unpublished doctoral dissertation). University of Roorkee, Roorkee, India."},{"key":"jncr.2012040105-5","author":"B.Boehm","year":"1981","journal-title":"Software engineering economics"},{"key":"jncr.2012040105-6","doi-asserted-by":"crossref","unstructured":"Boehm, B. (1995). Cost models for future software life cycle process: COCOMO2. Annals of Software Engineering.","DOI":"10.1007\/BF02249046"},{"key":"jncr.2012040105-7","doi-asserted-by":"publisher","DOI":"10.1145\/42288.214372"},{"key":"jncr.2012040105-8","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2010.2087317"},{"key":"jncr.2012040105-9","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(01)00192-6"},{"key":"jncr.2012040105-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.06.007"},{"key":"jncr.2012040105-11","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-008-9080-4"},{"issue":"32","key":"jncr.2012040105-12","first-page":"53","article-title":"Artificial bee colony algorithm based on Boltzmann selection strategy.","volume":"45","author":"D.Haijun","year":"2009","journal-title":"Computer Engineering and Applications"},{"key":"jncr.2012040105-13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386213"},{"key":"jncr.2012040105-14","doi-asserted-by":"publisher","DOI":"10.1145\/355588.365104"},{"key":"jncr.2012040105-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.04.024"},{"key":"jncr.2012040105-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2009.03.001"},{"key":"jncr.2012040105-17","unstructured":"Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization (Tech. Rep. No. TR06). Erciyes, Turkey: Computer Engineering Department, Erciyes University."},{"key":"jncr.2012040105-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.03.090"},{"key":"jncr.2012040105-19","doi-asserted-by":"crossref","unstructured":"Karaboga, D., Akay, B., & Ozturk, C. (2007). Artificial bee colony (ABC) optimization algorithm for training feed-forward neural networks. In V. Torra, Y. Narukawa, & Y. Yoshida (Eds.), Proceedings of the Modeling Decisions for Artificial Intelligence (LNCS 4617, pp. 318-329).","DOI":"10.1007\/978-3-540-73729-2_30"},{"key":"jncr.2012040105-20","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9149-x"},{"key":"jncr.2012040105-21","doi-asserted-by":"crossref","unstructured":"Karaboga, D., & Basturk, B. (2007). Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In P. Melin, O. Castillo, L. T. Aguilar, J. Kacprzyk, & W. Pedrycz (Eds.), Proceedings of the Advances in Soft Computing-Foundations of Fuzzy Logic and Soft Computing (LNCS 4529, pp. 789-798).","DOI":"10.1007\/978-3-540-72950-1_77"},{"key":"jncr.2012040105-22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2007.05.007"},{"key":"jncr.2012040105-23","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-012-9328-0"},{"key":"jncr.2012040105-24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2008.11.003"},{"key":"jncr.2012040105-25","doi-asserted-by":"publisher","DOI":"10.1145\/22899.22906"},{"key":"jncr.2012040105-26","doi-asserted-by":"publisher","DOI":"10.1137\/0915077"},{"key":"jncr.2012040105-27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.12.025"},{"key":"jncr.2012040105-28","doi-asserted-by":"crossref","first-page":"511","DOI":"10.3233\/FI-2009-162","article-title":"Low discrepancy initialized particle swarm optimization for solving constrained optimization problems.","volume":"95","author":"M.Pant","year":"2009","journal-title":"Fundamenta Informaticae"},{"key":"jncr.2012040105-29","unstructured":"Pawar, P., Rao, R., & Davim, J. (2008). Optimization of process parameters of milling process using particle swarm optimization and artificial bee colony algorithm. In Proceedings of the International Conference on Advances in Mechanical Engineering."},{"key":"jncr.2012040105-30","doi-asserted-by":"publisher","DOI":"10.1016\/0098-1354(93)80080-7"},{"key":"jncr.2012040105-31","doi-asserted-by":"crossref","unstructured":"Quan, H., & Shi, X. (2008). On the analysis of performance of the improved artificial-bee-colony algorithm. In Proceedings of the Fourth IEEE International Conference on Natural Computation, Jinan, China (pp. 654-658).","DOI":"10.1109\/ICNC.2008.211"},{"key":"jncr.2012040105-32","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.894200"},{"key":"jncr.2012040105-33","first-page":"116","article-title":"Optimization of distribution network configuration for loss reduction using artificial bee colony algorithm.","volume":"1","author":"R. S.Rao","year":"2008","journal-title":"International Journal of Electrical Power and Energy Systems Engineering"},{"key":"jncr.2012040105-34","doi-asserted-by":"crossref","unstructured":"Sharma, T. K., & Pant, M. (2011a). Enhancing the food locations in an artificial bee colony algorithm. In Proceedings of the IEEE Swarm Intelligence Symposium, Paris, France (pp. 1-5).","DOI":"10.1109\/SIS.2011.5952582"},{"key":"jncr.2012040105-35","doi-asserted-by":"crossref","unstructured":"Sharma, T. K., & Pant, M. (2011b). Halton based initial distribution in artificial bee colony algorithm and its application in software effort estimation. In Proceedings of the IEEE Sixth Conference on Bio-Inspired Computing: Theories and Applications, Penang, Malaysia (pp. 80-84).","DOI":"10.1109\/BIC-TA.2011.8"},{"key":"jncr.2012040105-36","doi-asserted-by":"crossref","unstructured":"Sharma, T. K., Pant, M., & Singh, V. P. (2011). Artificial bee colony algorithm with self adaptive colony size. In B. K. Panigrahi, P. N. Suganthan, S. Das, & S. C. Satapathy (Eds.), Proceedings of the Swarm, Evolutionary, and Memetic Computing, Vishakapatnam, India (LNCS 7076, pp. 593-600).","DOI":"10.1007\/978-3-642-27172-4_70"},{"key":"jncr.2012040105-37","doi-asserted-by":"publisher","DOI":"10.3844\/jcssp.2006.118.123"},{"key":"jncr.2012040105-38","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2008.09.001"},{"key":"jncr.2012040105-39","unstructured":"Storn, R., & Price, K. (1995). DE \u2013A simple and efficient adaptive scheme for global optimization over continuous space (Tech. Rep. No. TR-95-012). Berkeley, CA: ICSI. Retrieved from ftp.icsi.berkeley.edu\/pub\/techreports\/1995\/tr-95-012.ps.Z"},{"key":"jncr.2012040105-40","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"jncr.2012040105-41","unstructured":"Tang, K., Yaq, X., Suganthan, P. N., Macnish, C., Chen, Y. P., Chen, C. M., & Yang, Z. (2007). Benchmark functions for the CEC\u20192008 special session and competition on large scale global optimization (Tech. Rep.). Anhui, China: Nature Inspired Computation and Applications Laboratory. Retrieved from http:\/\/nical.ustc.edu.cn\/cec08ss.php"},{"issue":"12","key":"jncr.2012040105-42","first-page":"5081","article-title":"Enhanced artificial bee colony optimization.","volume":"5","author":"P. W.Tsai","year":"2009","journal-title":"International Journal of Innovative Computing, Information, & Control"},{"key":"jncr.2012040105-43","unstructured":"Uy, N. Q., Hoai, N. X., McKay, R., & Tuan, P. M. (2007). Initialising PSO with randomised low-discrepancy sequences: The comparative results. In Proceedings of the IEEE Congress on Evolutionary Computation (pp. 1985-1992)."},{"key":"jncr.2012040105-44","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014613"},{"key":"jncr.2012040105-45","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2010.08.049"}],"container-title":["International Journal of Natural Computing Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=73015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:14:07Z","timestamp":1654092847000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jncr.2012040105"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,4,1]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jncr.2012040105","relation":{},"ISSN":["1947-928X","1947-9298"],"issn-type":[{"value":"1947-928X","type":"print"},{"value":"1947-9298","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,1]]}}}