{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T10:13:43Z","timestamp":1768644823684,"version":"3.49.0"},"reference-count":45,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T00:00:00Z","timestamp":1593734400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The pigeon-inspired optimization algorithm is a category of a newly proposed swarm intelligence-based algorithm that belongs to the population-based solution technique. The MKP is a class of complex optimization problems that have many practical applications in the fields of engineering and sciences. Due to the practical applications of MKP, numerous algorithmic-based methods like local search and population-based search algorithms have been proposed to solve the MKP in the past few decades. This paper proposes a modified binary pigeon-inspired optimization algorithm named (Modified-BPIO) for the 0 - 1 multidimensional knapsack problem (MKP). The utilization of the binary pigeon-inspired optimization (BPIO) for solving the multidimensional knapsack problem came with huge success. However, it can be observed that the BPIO converges prematurely due to lost diversity during the search activities. Given the above, the crossover operator is integrated with the landmark component of the BPIO to improve the diversity of the solution space. The MKP benchmarks from the Operations Research (OR) library are utilized to test the performance of the proposed binary method. Experimentally, it is concluded that the proposed Modified-BPIO has a better performance when compared with the BPIO and existing state-of-the-arts that worked on the same MKP benchmarks.<\/jats:p>","DOI":"10.1515\/jisys-2018-0450","type":"journal-article","created":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T08:47:26Z","timestamp":1594370846000},"page":"90-103","source":"Crossref","is-referenced-by-count":6,"title":["A Modified Binary Pigeon-Inspired Algorithm for Solving the Multi-dimensional Knapsack Problem"],"prefix":"10.1515","volume":"30","author":[{"given":"Asaju La\u2019aro","family":"Bolaji","sequence":"first","affiliation":[{"name":"Department of Computer Sciences, Federal University Wukari, Wukari , Taraba State , Nigeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friday Zinzendoff","family":"Okwonu","sequence":"additional","affiliation":[{"name":"School of Quantitative Sciences, College of Arts and Sciences, Universiti Utara Malaysia, Sintok , Kedah , Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bamidele","family":"Shola","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Ilorin , Ilorin , Nigeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Babatunde Sulaiman","family":"Balogun","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Ilorin , Ilorin , Nigeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Obinna Damian","family":"Adubisi","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, Federal University Wukari, Wukari , Taraba State , Nigeria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2020,7,3]]},"reference":[{"key":"2025120523494766192_j_jisys-2018-0450_ref_001","doi-asserted-by":"crossref","unstructured":"Mohamed Abdel-Basset and Yongquan Zhou, An elite opposition-flower pollination algorithm for a 0-1 knapsack problem, International Journal of Bio-Inspired Computation 11 (2018), 46\u201353.","DOI":"10.1504\/IJBIC.2018.090080"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_002","unstructured":"Hazem Ahmed and Janice Glasgow, Swarm intelligence: concepts, models and applications, School Of Computing, Queens University Technical Report (2012)."},{"key":"2025120523494766192_j_jisys-2018-0450_ref_003","doi-asserted-by":"crossref","unstructured":"Leanderson Andr\u00e9 and Rafael Stubs Parpinelli, A Binary Differential Evolution with Adaptive Parameters Applied to the Multiple Knapsack Problem Nature-Inspired Computation and Machine Learning, Springer, 2014, pp. 61\u201371.","DOI":"10.1007\/978-3-319-13650-9_6"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_004","doi-asserted-by":"crossref","unstructured":"Jagdish Chand Bansal and Kusum Deep, A modified binary particle swarm optimization for knapsack problems, Applied Mathematics and Computation 218 (2012), 11042\u201311061.","DOI":"10.1016\/j.amc.2012.05.001"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_005","doi-asserted-by":"crossref","unstructured":"Asaju La\u2019aro Bolaji, Aminu Ali Ahmad and Peter Bamidele Shola, Training of neural network for pattern classification using fireworks algorithm, International Journal of System Assurance Engineering and Management 9 (2018), 208\u2013215.","DOI":"10.1007\/s13198-016-0526-z"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_006","doi-asserted-by":"crossref","unstructured":"Asaju La\u2019aro Bolaji, Mohammed Azmi Al-Betar, Mohammed A Awadallah, Ahamad Tajudin Khader and Laith Mohammad Abualigah, A comprehensive review: Krill Herd algorithm (KH) and its applications, Applied Soft Computing 49 (2016), 437\u2013446.","DOI":"10.1016\/j.asoc.2016.08.041"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_007","doi-asserted-by":"crossref","unstructured":"Asaju La\u2019aro Bolaji, Balogun Sulaiman Babatunde and Peter Bamidele Shola, Adaptation of Binary Pigeon-Inspired Algorithm for Solving Multidimensional Knapsack Problem Soft Computing: Theories and Applications, Springer, 2018, pp. 743\u2013751.","DOI":"10.1007\/978-981-10-5687-1_66"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_008","doi-asserted-by":"crossref","unstructured":"Mingchang Chih, Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem, Applied Soft Computing 26 (2015), 378\u2013389.","DOI":"10.1016\/j.asoc.2014.10.030"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_009","doi-asserted-by":"crossref","unstructured":"Mingchang Chih, Three pseudo-utility ratio-inspired particle swarm optimization with local search for multidimensional knapsack problem, Swarm and evolutionary computation 39 (2018), 279\u2013296.","DOI":"10.1016\/j.swevo.2017.10.008"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_010","doi-asserted-by":"crossref","unstructured":"Benny Chor and Ronald L Rivest, A knapsack-type public key cryptosystem based on arithmetic in finite fields, Information Theory, IEEE Transactions on 34 (1988), 901\u2013909.","DOI":"10.1109\/18.21214"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_011","doi-asserted-by":"crossref","unstructured":"Bianca De Almeida Dantas and Edson Norberto C\u00e1ceres, A Parallelization of a Simulated Annealing Approach for 0-1 Multidimensional Knapsack Problem Using GPGPU, in: Computer Architecture and High Performance Computing (SBAC-PAD), 2016 28th International Symposium on IEEE, pp. 134\u2013140, 2016.","DOI":"10.1109\/SBAC-PAD.2016.25"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_012","doi-asserted-by":"crossref","unstructured":"Haibin Duan and Peixin Qiao, Pigeon-inspired optimization: a new swarm intelligence optimizer for air robot path planning, International Journal of Intelligent Computing and Cybernetics 7 (2014), 24\u201337.","DOI":"10.1108\/IJICC-02-2014-0005"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_013","doi-asserted-by":"crossref","unstructured":"Amira Gherboudj, Abdesslem Layeb and Salim Chikhi, Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm, International Journal of Bio-Inspired Computation 4 (2012), 229\u2013236.","DOI":"10.1504\/IJBIC.2012.048063"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_014","doi-asserted-by":"crossref","unstructured":"Tim Guilford, Stephen Roberts, Dora Biro and Iead Rezek, Positional entropy during pigeon homing II: navigational interpretation of Bayesian latent state models, Journal of theoretical biology 227 (2004), 25\u201338.","DOI":"10.1016\/j.jtbi.2003.07.003"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_015","doi-asserted-by":"crossref","unstructured":"Boukthir Haddar, Mahdi Khemakhem, Sa\u00efd Hanafi and Christophe Wilbaut, A hybrid quantum particle swarm optimization for the multidimensional knapsack problem, Engineering Applications of Artificial Intelligence 55 (2016), 1\u201313.","DOI":"10.1016\/j.engappai.2016.05.006"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_016","doi-asserted-by":"crossref","unstructured":"Ran Hao, Delin Luo and Haibin Duan, Multiple UAVs mission assignment based on modified Pigeon-inspired optimization algorithm, in: Guidance, Navigation and Control Conference (CGNCC), 2014 IEEE Chinese IEEE, pp. 2692\u20132697, 2014.","DOI":"10.1109\/CGNCC.2014.7007592"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_017","doi-asserted-by":"crossref","unstructured":"Chaitr S Hiremath and Raymond R Hill, First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem, International Journal of Metaheuristics 2 (2013), 174\u2013199.","DOI":"10.1504\/IJMHEUR.2013.054150"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_018","doi-asserted-by":"crossref","unstructured":"Liangjun Ke, Zuren Feng, Zhigang Ren and Xiaoliang Wei, An ant colony optimization approach for the multidimensional knapsack problem, Journal of Heuristics 16 (2010), 65\u201383.","DOI":"10.1007\/s10732-008-9087-x"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_019","doi-asserted-by":"crossref","unstructured":"Min Kong and Peng Tian, Apply the particle swarm optimization to the multidimensional knapsack problem, in: International Conference on Artificial Intelligence and Soft Computing Springer, pp. 1140\u20131149, 2006.","DOI":"10.1007\/11785231_119"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_020","doi-asserted-by":"crossref","unstructured":"Xiangyong Kong, Liqun Gao, Haibin Ouyang and Steven Li, A simplified binary harmony search algorithm for large scale 0\u20131 knapsack problems, Expert Systems with Applications 42 (2015), 5337\u20135355.","DOI":"10.1016\/j.eswa.2015.02.015"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_021","doi-asserted-by":"crossref","unstructured":"Chi-Sung Laih, Jau-Yien Lee, Lein Harn and Yan-Kuin Su, Linearly shift knapsack public-key cryptosystem, Selected Areas in Communications, IEEE Journal on 7 (1989), 534\u2013539.","DOI":"10.1109\/49.17717"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_022","doi-asserted-by":"crossref","unstructured":"Abdesslem Layeb, A novel quantum inspired cuckoo search for knapsack problems, International Journal of Bio-Inspired Computation 3 (2011), 297\u2013305.","DOI":"10.1504\/IJBIC.2011.042260"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_023","unstructured":"Silvano Martello and Paolo Toth, Knapsack problems: algorithms and computer implementations John Wiley & Sons, Inc., 1990."},{"key":"2025120523494766192_j_jisys-2018-0450_ref_024","unstructured":"AJ McAuley, A New Trapdoor Knapsack Public Key Cryptosystem., in: Advances in Cryptology: Proceedings of EUROCRYPT 84. A Workshop on the Theory and Application of Cryptographic Techniques-Paris, France, April 9-11, 1984 209, Springer, p. 150, 2007."},{"key":"2025120523494766192_j_jisys-2018-0450_ref_025","doi-asserted-by":"crossref","unstructured":"Cordula V Mora, Michael Davison, J Martin Wild and Michael M Walker, Magnetoreception and its trigeminal mediation in the homing pigeon, Nature 432 (2004), 508\u2013511.","DOI":"10.1038\/nature03077"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_026","doi-asserted-by":"crossref","unstructured":"Wen-Tsao Pan, A new fruit fly optimization algorithm: taking the financial distress model as an example, Knowledge-Based Systems 26 (2012), 69\u201374.","DOI":"10.1016\/j.knosys.2011.07.001"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_027","doi-asserted-by":"crossref","unstructured":"HuaXin Qiu and HaiBin Duan, Multi-objective pigeon-inspired optimization for brushless direct current motor parameter design, Science China Technological Sciences 58 (2015), 1915\u20131923.","DOI":"10.1007\/s11431-015-5860-x"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_028","doi-asserted-by":"crossref","unstructured":"G\u00fcnther R Raidl and Jens Gottlieb, Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem, Evolutionary Computation 13 (2005), 441\u2013475.","DOI":"10.1162\/106365605774666886"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_029","doi-asserted-by":"crossref","unstructured":"Rizk M Rizk-Allah, Ragab A El-Sehiemy and Gai-Ge Wang, A novel parallel hurricane optimization algorithm for secure emission\/economic load dispatch solution, Applied Soft Computing 63 (2018), 206\u2013222.","DOI":"10.1016\/j.asoc.2017.12.002"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_030","doi-asserted-by":"crossref","unstructured":"Wei Shih, A branch and bound method for the multiconstraint zero-one knapsack problem, Journal of the Operational Research Society 30 (1979), 4.","DOI":"10.1057\/jors.1979.78"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_031","doi-asserted-by":"crossref","unstructured":"Shyam Sundar, Alok Singh and Andr\u00e9 Rossi, An artificial bee colony algorithm for the 0\u20131 multidimensional knapsack problem Contemporary Computing, Springer, 2010, pp. 141\u2013151.","DOI":"10.1007\/978-3-642-14834-7_14"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_032","doi-asserted-by":"crossref","unstructured":"MFatih Tasgetiren, Quan-Ke Pan, Damla Kizilay and Gursel Suer, A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem, in: Evolutionary Computation (CEC), 2015 IEEE Congress on IEEE, pp. 2797\u2013 2804, 2015.","DOI":"10.1109\/CEC.2015.7257236"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_033","doi-asserted-by":"crossref","unstructured":"Paolo Toth, Dynamic programming algorithms for the zero-one knapsack problem, Computing 25 (1980), 29\u201345.","DOI":"10.1007\/BF02243880"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_034","doi-asserted-by":"crossref","unstructured":"Gai-Ge Wang, Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems, Memetic Computing 10 (2018), 151\u2013164.","DOI":"10.1007\/s12293-016-0212-3"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_035","doi-asserted-by":"crossref","unstructured":"Gai-Ge Wang, Suash Deb and Leandro dos Santos Coelho, Earthworm optimisation algorithm: a bio-inspired metaheuristic algorithm for global optimisation problems., IJBIC 12 (2018), 1\u201322.","DOI":"10.1504\/IJBIC.2018.093328"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_036","doi-asserted-by":"crossref","unstructured":"Gai-Ge Wang, Suash Deb, Xiao-Zhi Gao and Leandro Dos Santos Coelho, A new metaheuristic optimisation algorithm motivated by elephant herding behaviour, International Journal of Bio-Inspired Computation 8 (2016), 394\u2013409.","DOI":"10.1504\/IJBIC.2016.081335"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_037","doi-asserted-by":"crossref","unstructured":"Gai-Ge Wang, Amir H Gandomi, Amir H Alavi and Dunwei Gong, A comprehensive review of krill herd algorithm: variants, hybrids and applications, Artificial Intelligence Review 51 (2019), 119\u2013148.","DOI":"10.1007\/s10462-017-9559-1"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_038","doi-asserted-by":"crossref","unstructured":"Haizhou Wu, Yongquan Zhou and Qifang Luo, Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem, International Journal of Bio-Inspired Computation 12 (2018), 23\u201353.","DOI":"10.1504\/IJBIC.2018.093334"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_039","doi-asserted-by":"crossref","unstructured":"Zhen Yang, Guoqing Wang and Feng Chu, An effective GRASP and tabu search for the 0\u20131 quadratic knapsack problem, Computers & Operations Research 40 (2013), 1176\u20131185.","DOI":"10.1016\/j.cor.2012.11.023"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_040","doi-asserted-by":"crossref","unstructured":"Bo Zhang and Haibin Duan, Predator-prey pigeon-inspired optimization for UAV three-dimensional path planning Advances in Swarm Intelligence, Springer, 2014, pp. 96\u2013105.","DOI":"10.1007\/978-3-319-11897-0_12"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_041","doi-asserted-by":"crossref","unstructured":"Shujian Zhang and Haibin Duan, Gaussian pigeon-inspired optimization approach to orbital spacecraft formation reconfiguration, Chinese Journal of Aeronautics 28 (2015), 200\u2013205.","DOI":"10.1016\/j.cja.2014.12.008"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_042","doi-asserted-by":"crossref","unstructured":"Shujian Zhang and Haibin Duan,Multiple UCAVs Target Assignment via Bloch Quantum-Behaved Pigeon-Inspired Optimization, in: Control Conference (CCC), 2015 34th Chinese IEEE, pp. 6936\u20136941, 2015.","DOI":"10.1109\/ChiCC.2015.7260736"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_043","doi-asserted-by":"crossref","unstructured":"Yongquan Zhou, Zongfan Bao, Qifang Luo and Sen Zhang, A complex-valued encoding wind driven optimization for the 0-1 knapsack problem, Applied Intelligence 46 (2017), 684\u2013702.","DOI":"10.1007\/s10489-016-0855-2"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_044","doi-asserted-by":"crossref","unstructured":"Yongquan Zhou, Xin Chen and Guo Zhou, An improved monkey algorithm for a 0-1 knapsack problem, Applied Soft Computing 38 (2016), 817\u2013830.","DOI":"10.1016\/j.asoc.2015.10.043"},{"key":"2025120523494766192_j_jisys-2018-0450_ref_045","doi-asserted-by":"crossref","unstructured":"Yongquan Zhou, Liangliang Li and Mingzhi Ma, A complex-valued encoding bat algorithm for solving 0\u20131 knapsack problem, Neural Processing Letters 44 (2016), 407\u2013430.","DOI":"10.1007\/s11063-015-9465-y"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/30\/1\/article-p90.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0450\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0450\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:50:42Z","timestamp":1764978642000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0450\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,3]]},"references-count":45,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,8,15]]},"published-print":{"date-parts":[[2020,8,15]]}},"alternative-id":["10.1515\/jisys-2018-0450"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2018-0450","relation":{},"ISSN":["2191-026X"],"issn-type":[{"value":"2191-026X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,3]]}}}