{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:51:37Z","timestamp":1742997097660,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031346217"},{"type":"electronic","value":"9783031346224"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34622-4_14","type":"book-chapter","created":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T20:25:17Z","timestamp":1686428717000},"page":"173-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Clustering Based Niching Method for\u00a0Effectively Solving the\u00a00-1 Knapsack Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8628-6684","authenticated-orcid":false,"given":"Md. Meheruzzaman","family":"Sarker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4919-151X","authenticated-orcid":false,"given":"Md. Jakirul","family":"Islam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2055-3318","authenticated-orcid":false,"given":"Md. Zakir","family":"Hossain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,11]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1162\/106365602760234081","volume":"10","author":"JP Li","year":"2002","unstructured":"Li, J.P., Balazs, M.E., Parks, G.T., Clarkson, P.J.: A species conserving genetic algorithm for multimodal function optimization. Evol. Comput. 10(3), 207\u2013234 (2002)","journal-title":"Evol. Comput."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Soukaina, L., Mohamed, N., Hassan, E., Boujem\u00e2a, A.: A hybrid genetic algorithm for solving 0\/1 knapsack problem. In: Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications, pp. 1\u20136 (2018)","DOI":"10.1145\/3230905.3230907"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.eswa.2016.01.055","volume":"54","author":"TY Lim","year":"2016","unstructured":"Lim, T.Y., Al-Betar, M.A., Khader, A.T.: Taming the 0\/1 knapsack problem with monogamous pairs genetic algorithm. Exp. Syst. Appl. 54, 241\u201350 (2016)","journal-title":"Exp. Syst. Appl."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"104982","DOI":"10.1109\/ACCESS.2019.2930638","volume":"7","author":"S Zhang","year":"2019","unstructured":"Zhang, S., Liu, S.: A discrete improved artificial bee colony algorithm for 0\u20131 knapsack problem. IEEE Access 7, 104982\u2013104991 (2019)","journal-title":"IEEE Access"},{"issue":"2","key":"14_CR5","first-page":"9","volume":"10","author":"A Alzaqebah","year":"2019","unstructured":"Alzaqebah, A., Abu-Shareha, A.A.: Ant colony system algorithm with dynamic pheromone updating for 0\/1 knapsack problem. Int. J. Intell. Syst. Appl. 10(2), 9\u201317 (2019)","journal-title":"Int. J. Intell. Syst. Appl."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Moradi, N., Kayvanfar, V., Rafiee, M.: An efficient population-based simulated annealing algorithm for 0\u20131 knapsack problem. Eng. Comput. 5, 1\u201320 (2021)","DOI":"10.1007\/s00366-020-01240-3"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"54447","DOI":"10.1109\/ACCESS.2018.2872533","volume":"6","author":"SH Zhan","year":"2018","unstructured":"Zhan, S.H., Zhang, Z.J., Wang, L.J., Zhong, Y.W.: List-based simulated annealing algorithm with hybrid greedy repair and optimization operator for 0\u20131 knapsack problem. IEEE Access 6, 54447\u201354458 (2018)","journal-title":"IEEE Access"},{"key":"14_CR8","unstructured":"Sun, W.Z., Zhang, M., Wang, J.S., Guo, S.S., Wang, M., Hao, W.K.: Binary particle swarm optimization algorithm based on Z-shaped probability transfer function to solve 0\u20131 knapsack problem. IAENG Int. J. Comput. Sci. 48(2) (2021)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.asoc.2017.04.050","volume":"59","author":"MJ Islam","year":"2017","unstructured":"Islam, M.J., Li, X., Mei, Y.: A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO. Appl. Soft Comput. 59, 182\u2013196 (2017)","journal-title":"Appl. Soft Comput."},{"key":"14_CR10","unstructured":"Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pp. 41\u201349. Lawrence Erlbaum, Hillsdale (1987)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"P\u00e9trowski, A.: A clearing procedure as a niching method for genetic algorithms. In: Proceedings of IEEE International Conference on Evolutionary Computation. pp. 798\u2013803. IEEE (1996)","DOI":"10.1109\/ICEC.1996.542703"},{"key":"14_CR12","unstructured":"Mahfoud, S.W.: Niching methods for genetic algorithm. Ph.D. thesis, University of Illinois (1995)"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/TEVC.2005.859468","volume":"10","author":"D Parrott","year":"2006","unstructured":"Parrott, D., Li, X.: Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Trans. Evol. Comput. 10(4), 440\u201358 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/TEVC.2009.2026270","volume":"14","author":"X Li","year":"2010","unstructured":"Li, X.: Niching without niching parameters: particle swarm optimization using a ring topology. IEEE Trans. Evol. Comput. 14(1), 150\u2013169 (2010)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Lynn, N., Suganthan, P.N.: Distance based locally informed particle swarm optimizer with dynamic population size. In: Proceedings of the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems, pp. 577\u2013587 (2015)","DOI":"10.1007\/978-3-319-13356-0_45"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1109\/TEVC.2019.2944180","volume":"24","author":"ZG Chen","year":"2019","unstructured":"Chen, Z.G., Zhan, Z.H., Wang, H., Zhang, J.: Distributed individuals for multiple peaks: a novel differential evolution for multimodal optimization problems. IEEE Trans. Evol. Comput. 24(4), 708\u201319 (2019)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"14_CR17","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-23204-1_9","volume-title":"Genetic and Evolutionary Computing","author":"A Ueno","year":"2016","unstructured":"Ueno, A., Hagita, N., Takubo, T.: A niching genetic algorithm including an inbreeding mechanism for multimodal problems. In: Zin, T.T., Lin, J.C.-W., Pan, J.-S., Tin, P., Yokota, M. (eds.) Genetic and Evolutionary Computing. AISC, vol. 387, pp. 71\u201380. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-23204-1_9"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.swevo.2017.03.002","volume":"35","author":"P Haghbayan","year":"2017","unstructured":"Haghbayan, P., Nezamabadi-Pour, H., Kamyab, S.: A niche GSA method with nearest neighbor scheme for multimodal optimization. Swarm Evol. Comput. 35, 78\u201392 (2017)","journal-title":"Swarm Evol. Comput."},{"issue":"5","key":"14_CR19","doi-asserted-by":"publisher","first-page":"2179","DOI":"10.3233\/IFS-141500","volume":"28","author":"TK Truong","year":"2015","unstructured":"Truong, T.K., Li, K., Xu, Y., Ouyang, A., Nguyen, T.T.: Solving 0\u20131 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy. J. Intell. Fuzzy Syst. 28(5), 2179\u201386 (2015)","journal-title":"J. Intell. Fuzzy Syst."},{"issue":"6","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1080\/18756891.2016.1256577","volume":"9","author":"Y Feng","year":"2016","unstructured":"Feng, Y., Wang, G.G., Gao, X.Z.: A novel hybrid cuckoo search algorithm with global harmony search for 0\u20131 knapsack problems. Int. J. Comput. Intell. Syst. 9(6), 1174\u20131190 (2016)","journal-title":"Int. J. Comput. Intell. Syst."},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"411","DOI":"10.11591\/ijeecs.v1.i3.pp411-418","volume":"1","author":"PH Nguyen","year":"2016","unstructured":"Nguyen, P.H., Wang, D., Truong, T.K.: A new hybrid particle swarm optimization and greedy for 0\u20131 knapsack problem. Indonesian J. Electric. Eng. Comput. Sci. 1(3), 411\u2013418 (2016)","journal-title":"Indonesian J. Electric. Eng. Comput. Sci."},{"key":"14_CR22","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-319-68527-4_37","volume-title":"Proceedings of the Fourth Euro-China Conference on Intelligent Data Analysis and Applications","author":"J Wang","year":"2018","unstructured":"Wang, J., Liu, J., Pan, J.-S., Xue, X., Huang, L.: A hybrid BPSO-GA algorithm for 0-1 knapsack problems. In: Kr\u00f6mer, P., Alba, E., Pan, J.-S., Sn\u00e1\u0161el, V. (eds.) ECC 2017. AISC, vol. 682, pp. 344\u2013351. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-68527-4_37"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.compeleceng.2017.12.014","volume":"67","author":"Y Feng","year":"2018","unstructured":"Feng, Y., Wang, G.G., Dong, J., Wang, L.: Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0\u20131 knapsack problem. Comput. Electric. Eng. 67, 454\u201368 (2018)","journal-title":"Comput. Electric. Eng."},{"issue":"3","key":"14_CR24","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s13042-017-0731-3","volume":"10","author":"M Abdel-Basset","year":"2019","unstructured":"Abdel-Basset, M., El-Shahat, D., Sangaiah, A.K.: A modified nature inspired meta-heuristic whale optimization algorithm for solving 0\u20131 knapsack problem. Int. J. Mach. Learn. Cybern. 10(3), 495\u2013514 (2019)","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"66055","DOI":"10.1109\/ACCESS.2019.2917889","volume":"7","author":"L Ye","year":"2019","unstructured":"Ye, L., Zheng, J., Guo, P., P\u00e9rez-Jim\u00e9nez, M.J.: Solving the 0\u20131 knapsack problem by using tissue p system with cell division. IEEE Access 7, 66055\u201366067 (2019)","journal-title":"IEEE Access"},{"key":"14_CR26","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-981-15-3290-0_19","volume-title":"Soft Computing for Problem Solving 2019","author":"S Mirjalili","year":"2020","unstructured":"Mirjalili, S., Zhang, H., Mirjalili, S., Chalup, S., Noman, N.: A novel U-shaped transfer function for\u00a0binary particle swarm optimisation. In: Nagar, A.K., Deep, K., Bansal, J.C., Das, K.N. (eds.) Soft Computing for Problem Solving 2019. AISC, vol. 1138, pp. 241\u2013259. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-3290-0_19"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Mathews, G.B.: On the partition of numbers. In: Proceedings of the London Mathematical Society, vol. s1\u201328, no. (1), pp. 486\u2013490 (1896)","DOI":"10.1112\/plms\/s1-28.1.486"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, pp. 4104\u20134108 (1997). https:\/\/doi.org\/10.1109\/ICSMC.1997.637339","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"14_CR31","first-page":"11042","volume":"218","author":"J Bansal","year":"2012","unstructured":"Bansal, J., Deep, K.: A modified binary particle swarm optimization for knapsack problems. Appl. Math. Comput. 218, 11042\u201311061 (2012)","journal-title":"Appl. Math. Comput."},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ins.2012.12.043","volume":"232","author":"L Wang","year":"2013","unstructured":"Wang, L., Yang, R., Xu, Y., Niu, Q., Pardalos, P., Fei, M.: An improved adaptive binary Harmony Search algorithm. Inf. Sci. 232, 58\u201387 (2013)","journal-title":"Inf. Sci."},{"key":"14_CR33","unstructured":"Liu, J., Yang, R., Sun, S.: The analysis of binary particle swarm optimization. J. Nanjing Univ. (Nat. Sci.) 47, 504\u2013514 (2011)"},{"key":"14_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili, S., Lewis, A.: S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evol. Comput. 9, 1\u201314 (2013)","journal-title":"Swarm Evol. Comput."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Machine Intelligence and Emerging Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34622-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T20:26:51Z","timestamp":1686428811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34622-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031346217","9783031346224"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34622-4_14","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIET","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Intelligence and Emerging Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Noakhali","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"miet2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/confmiet.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy plus","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"272","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}