{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T14:18:59Z","timestamp":1783779539931,"version":"3.55.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,6,14]],"date-time":"2014-06-14T00:00:00Z","timestamp":1402704000000},"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":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s13042-014-0272-y","type":"journal-article","created":{"date-parts":[[2014,6,13]],"date-time":"2014-06-13T08:15:31Z","timestamp":1402647331000},"page":"427-441","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":93,"title":["Solving 0\u20131 Knapsack Problem using Cohort Intelligence Algorithm"],"prefix":"10.1007","volume":"7","author":[{"given":"Anand J.","family":"Kulkarni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hinna","family":"Shabir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,6,14]]},"reference":[{"key":"272_CR1","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Meth Appl Mech Eng 186:311\u2013338","journal-title":"Comput Meth Appl Mech Eng"},{"issue":"4","key":"272_CR2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1080\/03052150108940926","volume":"33","author":"T Ray","year":"2001","unstructured":"Ray T, Tai K, Seow KC (2001) Multiobjective design optimization by an evolutionary algorithm. Eng Optim 33(4):399\u2013424","journal-title":"Eng Optim"},{"key":"272_CR3","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, pp 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"272_CR4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stitzle T (2006) Ant colony optimization: artificial ants as a computational intelligence technique. IEEE Comput Intell Mag 1:28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"272_CR5","unstructured":"Pham DT, Ghanbarzadeh A, Koc E, Otri S, Rahim S, Zaidi M (2005) The Bees algorithm, technical note. Manufacturing Engineering Centre, Cardiff University"},{"key":"272_CR6","first-page":"1","volume":"2014","author":"Y Feng","year":"2014","unstructured":"Feng Y, Jia K, He Y (2014) An improved hybrid encoding cuckoo search algorithm for 0\u20131 Knapsack Problems. Comput Intell Neurosci 2014:1\u20139","journal-title":"Comput Intell Neurosci"},{"key":"272_CR7","doi-asserted-by":"crossref","unstructured":"Kulkarni AJ, Durugkar IP, Kumar MR (2013) Cohort intelligence: a self supervised learning behavior. In: Proc. of IEEE international conference on systems, man, and cybernetics, pp 396\u2013400","DOI":"10.1109\/SMC.2013.241"},{"key":"272_CR8","first-page":"267","volume":"36","author":"L Liu","year":"2010","unstructured":"Liu L, Zhong WM, Qian F (2010) An improved chaos-particle swarm optimization algorithm. J East China Univ Sci Technol (Nat Sci Ed) 36:267\u2013272","journal-title":"J East China Univ Sci Technol (Nat Sci Ed)"},{"key":"272_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ins.2012.06.003","volume":"218","author":"W Xu","year":"2013","unstructured":"Xu W, Geng Z, Zhu Q, Gu X (2013) A piecewise linear chaotic map and sequential quadratic programming based robust hybrid particle swarm optimization. Inf Sci 218:85\u2013102","journal-title":"Inf Sci"},{"key":"272_CR10","doi-asserted-by":"crossref","unstructured":"Kennedy J (2003) Bare bones particle swarms. In: Proceedings of the IEEE swarm intelligence symposium (SIS\u201903), pp 80\u201387","DOI":"10.1109\/SIS.2003.1202251"},{"issue":"3","key":"272_CR11","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/TEVC.2004.826074","volume":"8","author":"R Mendes","year":"2004","unstructured":"Mendes R, Kennedy J, Neves J (2004) The fully informed particle swarm: simpler. Maybe better. IEEE Trans Evol Comput 8(3):204\u2013210","journal-title":"IEEE Trans Evol Comput"},{"key":"272_CR12","doi-asserted-by":"crossref","unstructured":"Chen L, Sun H, Wang S (2009) Solving continuous optimization using ant colony algorithm. In: Second international conference on future information technology and management engineering, pp 92\u201395","DOI":"10.1109\/FITME.2009.29"},{"issue":"1","key":"272_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"272_CR14","doi-asserted-by":"crossref","unstructured":"Krishnasamy G, Kulkarni AJ, Paramesran R (2014) A hybrid approach for data clustering based on modified cohort intelligence and K-means. Exp Syst Appl 41(3):6009\u20136016","DOI":"10.1016\/j.eswa.2014.03.021"},{"key":"272_CR15","doi-asserted-by":"crossref","unstructured":"Hern\u00e1ndez PR, Dimopoulos NJ (2005) A new heuristic for solving the multichoice multidimensional Knapsack Problem. In: Proc. of IEEE transactions on systems, man, and cybernetics\u2014part A : systems and humans, vol 35, no 5, pp 708\u2013717","DOI":"10.1109\/TSMCA.2005.851140"},{"key":"272_CR16","unstructured":"Martello S, Toth P (1990) Knapsack Problems: algorithms and computer implementations. Wiley, New York, pp 1\u2013296 (1990)"},{"issue":"3","key":"272_CR17","first-page":"604","volume":"38","author":"J Tavares","year":"2008","unstructured":"Tavares J, Pereira FB, Costa E (2008) Multidimensional Knapsack Problem: a fitness landscape analysis. In: Proc. of IEEE transactions on systems, man, and cybernetics\u2014part B. Cybernetics 38(3):604\u2013616","journal-title":"Cybernetics"},{"key":"272_CR18","doi-asserted-by":"crossref","unstructured":"Moser M (1996) Declarative scheduling for optimally graceful QoS degradation. In: Proc. IEEE international conference multimedia computing systems, pp 86\u201393 (1996)","DOI":"10.1109\/MMCS.1996.534959"},{"key":"272_CR19","unstructured":"Khan MS (1998) Quality adaptation in a multisession multimedia system: model, algorithms and architecture. Ph.D. dissertation, Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada (1998)"},{"key":"272_CR20","doi-asserted-by":"crossref","unstructured":"Warner D, Prawda J (1972) A mathematical programming model for scheduling nursing personnel in a hospital. Manag Sci (Application Series Part 1) 19(4):411\u2013422","DOI":"10.1287\/mnsc.19.4.411"},{"key":"272_CR21","unstructured":"Psinger D (1995) Algorithms for Knapsack Problems. PhD thesis, Department of Computer Science, University of Copenhagen, Copenhagen, Denmark (1995)"},{"key":"272_CR22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:345\u2013358","journal-title":"Eur J Oper Res"},{"issue":"1","key":"272_CR23","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/TSMCB.2006.879012","volume":"37","author":"OC Granmo","year":"2007","unstructured":"Granmo OC, Oommen BJ, Myrer SA, Olsen MG (2007) Learning automata-based solutions to the nonlinear fractional Knapsack Problem with applications to optimal resource allocation. Proc IEEE Trans Syst Man Cybern Part B Cybern 37(1):166\u2013175","journal-title":"Proc IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"272_CR24","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","volume":"11","author":"D Zou","year":"2011","unstructured":"Zou D, Gao L, Li S, Wu J (2011) Solving 0\u20131 Knapsack Problem by a Novel Global Harmony Search algorithm. Appl Soft Comput 11:1556\u20131564","journal-title":"Appl Soft Comput"},{"key":"272_CR25","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.cam.2013.04.004","volume":"253","author":"A Layeb","year":"2013","unstructured":"Layeb A (2013) A hybrid Quantum Inspired Harmony Search algorithm for 0\u20131 optimization problems. J Comput Appl Math 253:14\u201325","journal-title":"J Comput Appl Math"},{"issue":"5","key":"272_CR26","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1504\/IJBIC.2011.042260","volume":"3","author":"A Layeb","year":"2011","unstructured":"Layeb A (2011) A novel Quantum Inspired Cuckoo Search for Knapsack Problems. Int J Bio-Inspired Comput 3(5):297\u2013305","journal-title":"Int J Bio-Inspired Comput"},{"issue":"2","key":"272_CR27","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368","journal-title":"Simulation"},{"key":"272_CR28","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1016\/j.amc.2006.11.033","volume":"188","author":"M Mahdavi","year":"2007","unstructured":"Mahdavi M, Fesanghary M, Damangir E (2007) An Improved Harmony Search algorithm for solving optimization problems. Appl Math Comput 188:1567\u20131579","journal-title":"Appl Math Comput"},{"key":"272_CR29","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Meth Appl Mech Eng 186:311\u2013338","journal-title":"Comput Meth Appl Mech Eng"},{"issue":"4","key":"272_CR30","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1142\/S1469026811003185","volume":"10","author":"AJ Kulkarni","year":"2011","unstructured":"Kulkarni AJ, Tai K (2011) Solving constrained optimization problems using probability collectives and a penalty function approach. Int J Comput Intell Appl 10(4):445\u2013470","journal-title":"Int J Comput Intell Appl"},{"key":"272_CR31","doi-asserted-by":"crossref","unstructured":"Kulkarni AJ, Tai K (2011) A probability collectives approach with a feasibility-based rule for constrained optimization. Appl Comput Intell Soft Comput 2011, Article ID 980216","DOI":"10.1155\/2011\/980216"},{"issue":"2","key":"272_CR32","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s13042-013-0167-3","volume":"5","author":"W Ma","year":"2014","unstructured":"Ma W, Wang M, Zhu X (2014) Improved particle swarm optimization based approach for bilevel programming problem-an application on supply chain model. Int J Mach Learn Cybernet 5(2):281\u2013292","journal-title":"Int J Mach Learn Cybernet"},{"issue":"3","key":"272_CR33","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s13042-011-0053-9","volume":"3","author":"CJ Chen","year":"2012","unstructured":"Chen CJ (2012) Structural vibration suppression by using neural classifier with genetic algorithm. Int J Mach Learn Cybernet 3(3):215\u2013221","journal-title":"Int J Mach Learn Cybernet"},{"key":"272_CR34","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.neucom.2005.05.006","volume":"68","author":"XZ Wang","year":"2005","unstructured":"Wang XZ, He Q, Chen DG, Yeung D (2005) A genetic algorithm for solving the inverse problem of support vector machines. Neurocomputing 68:225\u2013238","journal-title":"Neurocomputing"},{"issue":"19","key":"272_CR35","doi-asserted-by":"crossref","first-page":"4230","DOI":"10.1016\/j.ins.2011.06.002","volume":"181","author":"XZ Wang","year":"2011","unstructured":"Wang XZ, He YL, Dong LC, Zhao HY (2011) Particle swarm optimization for determining fuzzy measures from data. Inf Sci 181(19):4230\u20134252","journal-title":"Inf Sci"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0272-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-014-0272-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0272-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T14:01:32Z","timestamp":1565532092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-014-0272-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,14]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["272"],"URL":"https:\/\/doi.org\/10.1007\/s13042-014-0272-y","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,14]]}}}