{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T09:54:57Z","timestamp":1768038897704,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s00500-022-07285-4","type":"journal-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T22:26:13Z","timestamp":1657664773000},"page":"12761-12778","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6788-8222","authenticated-orcid":false,"given":"Sasan","family":"Harifi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,12]]},"reference":[{"issue":"9","key":"7285_CR1","doi-asserted-by":"publisher","first-page":"5477","DOI":"10.1007\/s00521-018-3375-7","volume":"31","author":"M Abdel-Basset","year":"2019","unstructured":"Abdel-Basset M, El-Shahat D, El-Henawy I (2019) Solving 0\u20131 knapsack problem by binary flower pollination algorithm. Neural Comput Appl 31(9):5477\u20135495","journal-title":"Neural Comput Appl"},{"issue":"3","key":"7285_CR2","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 AK (2019) A modified nature inspired meta-heuristic whale optimization algorithm for solving 0\u20131 knapsack problem. Int J Mach Learn Cybern 10(3):495\u2013514","journal-title":"Int J Mach Learn Cybern"},{"key":"7285_CR3","doi-asserted-by":"crossref","unstructured":"Abdel-Basset M, Luo Q, Miao F, Zhou Y (2017) Solving 0\u20131 knapsack problems by binary dragonfly algorithm. In: International conference on intelligent computing. pp 491\u2013502","DOI":"10.1007\/978-3-319-63315-2_43"},{"key":"7285_CR4","doi-asserted-by":"crossref","unstructured":"Abdollahzadeh B, Barshandeh S, Javadi H, Epicoco N (2021) An enhanced binary slime mould algorithm for solving the 0\u20131 knapsack problem. Eng Comput pp 1\u201322","DOI":"10.1007\/s00366-021-01470-z"},{"key":"7285_CR5","doi-asserted-by":"crossref","unstructured":"Adeyemo H, Ahmed M (2017) Solving 0\/1 knapsack problem using metaheuristic techniques. In: 2017 9th IEEE-GCC Conference and Exhibition (GCCCE). pp 1\u20136","DOI":"10.1109\/IEEEGCC.2017.8448239"},{"key":"7285_CR6","doi-asserted-by":"crossref","unstructured":"Ali IM, Essam D, Kasmarik K (2018) An efficient differential evolution algorithm for solving 0\u20131 knapsack problems. In: 2018 IEEE Congress on Evolutionary Computation (CEC). pp 1\u20138","DOI":"10.1109\/CEC.2018.8477916"},{"issue":"22","key":"7285_CR7","first-page":"11042","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal JC, Deep K (2012) A modified binary particle swarm optimization for knapsack problems. Appl Math Comput 218(22):11042\u201311061","journal-title":"Appl Math Comput"},{"issue":"1","key":"7285_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1515\/jisys-2018-0450","volume":"30","author":"ALA Bolaji","year":"2021","unstructured":"Bolaji ALA, Okwonu FZ, Shola PB, Balogun BS, Adubisi OD (2021) A modified binary pigeon-inspired algorithm for solving the multi-dimensional knapsack problem. J Intell Syst 30(1):90\u2013103","journal-title":"J Intell Syst"},{"issue":"6","key":"7285_CR9","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1007\/s10489-017-1025-x","volume":"48","author":"J Cao","year":"2018","unstructured":"Cao J, Yin B, Lu X, Kang Y, Chen X (2018) A modified artificial bee colony approach for the 0\u20131 knapsack problem. Appl Intell 48(6):1582\u20131595","journal-title":"Appl Intell"},{"issue":"2","key":"7285_CR10","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s00500-021-06331-x","volume":"26","author":"G Capobianco","year":"2022","unstructured":"Capobianco G, D\u2019Ambrosio C, Pavone L, Raiconi A, Vitale G, Sebastiano F (2022) A hybrid metaheuristic for the Knapsack Problem with Forfeits. Soft Comput 26(2):749\u2013762","journal-title":"Soft Comput"},{"key":"7285_CR11","doi-asserted-by":"crossref","unstructured":"Ebrahimnejad S, Harifi S (2022) An optimized evacuation model with compatibility constraints in the context of disability: an ancient-inspired Giza Pyramids Construction metaheuristic approach. Appl Intell pp 1\u201334","DOI":"10.1007\/s10489-021-03079-7"},{"key":"7285_CR12","doi-asserted-by":"publisher","first-page":"43979","DOI":"10.1109\/ACCESS.2019.2908489","volume":"7","author":"AE Ezugwu","year":"2019","unstructured":"Ezugwu AE, Pillay V, Hirasen D, Sivanarain K, Govender M (2019) A comparative study of meta-heuristic optimization algorithms for 0\u20131 knapsack problem: Some initial results. IEEE Access 7:43979\u201344001","journal-title":"IEEE Access"},{"key":"7285_CR13","doi-asserted-by":"publisher","first-page":"10708","DOI":"10.1109\/ACCESS.2018.2809445","volume":"6","author":"YH Feng","year":"2018","unstructured":"Feng YH, Wang GG (2018) Binary moth search algorithm for discounted 0\u20131 knapsack problem. IEEE Access 6:10708\u201310719","journal-title":"IEEE Access"},{"key":"7285_CR14","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.future.2021.07.033","volume":"126","author":"Y Feng","year":"2022","unstructured":"Feng Y, Wang GG (2022) A binary moth search algorithm based on self-learning for multidimensional knapsack problems. Future Gener Comput Syst 126:48\u201364","journal-title":"Future Gener Comput Syst"},{"issue":"7","key":"7285_CR15","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1007\/s00521-015-2135-1","volume":"28","author":"Y Feng","year":"2017","unstructured":"Feng Y, Wang GG, Deb S, Lu M, Zhao XJ (2017) Solving 0\u20131 knapsack problem by a novel binary monarch butterfly optimization. Neural Comput Appl 28(7):1619\u20131634","journal-title":"Neural Comput Appl"},{"issue":"10","key":"7285_CR16","doi-asserted-by":"publisher","first-page":"3019","DOI":"10.1007\/s00521-017-2903-1","volume":"30","author":"Y Feng","year":"2018","unstructured":"Feng Y, Wang GG, Li W, Li N (2018) Multi-strategy monarch butterfly optimization algorithm for discounted 0\u20131 knapsack problem. Neural Comput Appl 30(10):3019\u20133036","journal-title":"Neural Comput Appl"},{"issue":"9","key":"7285_CR17","doi-asserted-by":"publisher","first-page":"1951","DOI":"10.1007\/s13042-020-01085-8","volume":"11","author":"J Garc\u00eda","year":"2020","unstructured":"Garc\u00eda J, Lalla-Ruiz E, Vo\u00df S, Droguett EL (2020) Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem. Int J Mach Learn Cybern 11(9):1951\u20131970","journal-title":"Int J Mach Learn Cybern"},{"issue":"20","key":"7285_CR18","doi-asserted-by":"publisher","first-page":"2611","DOI":"10.3390\/math9202611","volume":"9","author":"J Garc\u00eda","year":"2021","unstructured":"Garc\u00eda J, Lemus-Romani J, Altimiras F, Crawford B, Soto R, Becerra-Rozas M, Astorga G (2021) A binary machine learning cuckoo search algorithm improved by a local search operator for the set-union knapsack problem. Mathematics 9(20):2611","journal-title":"Mathematics"},{"key":"7285_CR19","doi-asserted-by":"crossref","unstructured":"Hajarian, M, Shahbahrami A, Hoseini F (2016) A parallel solution for the 0\u20131 knapsack problem using firefly algorithm. In: 2016 1st Conference on Swarm Intelligence and Evolutionary Computation (CSIEC). pp 25\u201330","DOI":"10.1109\/CSIEC.2016.7482134"},{"issue":"2","key":"7285_CR20","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s12065-019-00212-x","volume":"12","author":"S Harifi","year":"2019","unstructured":"Harifi S, Khalilian M, Mohammadzadeh J, Ebrahimnejad S (2019) Emperor penguins colony: a new metaheuristic algorithm for optimization. Evolut Intell 12(2):211\u2013226","journal-title":"Evolut Intell"},{"issue":"4","key":"7285_CR21","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1007\/s12065-020-00451-3","volume":"14","author":"S Harifi","year":"2021","unstructured":"Harifi S, Mohammadzadeh J, Khalilian M, Ebrahimnejad S (2021) Giza pyramids construction: an ancient-inspired metaheuristic algorithm for optimization. Evolut Intell 14(4):1743\u20131761","journal-title":"Evolut Intell"},{"key":"7285_CR22","doi-asserted-by":"crossref","unstructured":"Harifi S, Khalilian M, Mohammadzadeh J, Ebrahimnejad S (2020) New generation of metaheuristics by inspiration from ancient. In: 2020 10th International Conference on Computer and Knowledge Engineering (ICCKE). pp 256\u2013261","DOI":"10.1109\/ICCKE50421.2020.9303653"},{"key":"7285_CR23","doi-asserted-by":"publisher","first-page":"113613","DOI":"10.1016\/j.eswa.2020.113613","volume":"158","author":"II Huerta","year":"2020","unstructured":"Huerta II, Neira DA, Ortega DA, Varas V, Godoy J, As\u00edn-Ach\u00e1 R (2020) Anytime automatic algorithm selection for knapsack. Expert Syst Appl 158:113613","journal-title":"Expert Syst Appl"},{"issue":"5","key":"7285_CR24","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch S, Chauhan SS, Kumar V (2021) A review on genetic algorithm: past, present, and future. Multimed Tools Appl 80(5):8091\u20138126","journal-title":"Multimed Tools Appl"},{"issue":"4598","key":"7285_CR25","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Sci 220(4598):671\u2013680","journal-title":"Sci"},{"issue":"3","key":"7285_CR26","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s13042-014-0272-y","volume":"7","author":"AJ Kulkarni","year":"2016","unstructured":"Kulkarni AJ, Shabir H (2016) Solving 0\u20131 knapsack problem using cohort intelligence algorithm. Int J Mach Learn Cybern 7(3):427\u2013441","journal-title":"Int J Mach Learn Cybern"},{"key":"7285_CR27","doi-asserted-by":"crossref","unstructured":"Li Y, He Y, Li H, Guo X, Li Z (2018) A binary particle swarm optimization for solving the bounded knapsack problem. In: International Symposium on Intelligence Computation and Applications. pp 50-60","DOI":"10.1007\/978-981-13-6473-0_5"},{"key":"7285_CR28","doi-asserted-by":"crossref","unstructured":"Moradi N, Kayvanfar V, Rafiee M (2021) An efficient population-based simulated annealing algorithm for 0\u20131 knapsack problem. Eng Comput pp 1\u201320","DOI":"10.1007\/s00366-020-01240-3"},{"issue":"6","key":"7285_CR29","first-page":"2039","volume":"13","author":"PH Nguyen","year":"2017","unstructured":"Nguyen PH, Wang D, Truong TK (2017) A novel binary social spider algorithm for 0\u20131 knapsack problem. Int J Innov Comput Inf Control 13(6):2039\u20132049","journal-title":"Int J Innov Comput Inf Control"},{"key":"7285_CR30","doi-asserted-by":"publisher","first-page":"224200","DOI":"10.1109\/ACCESS.2020.3044005","volume":"8","author":"HA Nomer","year":"2020","unstructured":"Nomer HA, Alnowibet KA, Elsayed A, Mohamed AW (2020) Neural knapsack: a neural network based solver for the knapsack problem. IEEE Access 8:224200\u2013224210","journal-title":"IEEE Access"},{"key":"7285_CR31","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1016\/j.procs.2021.08.070","volume":"192","author":"M Nssibi","year":"2021","unstructured":"Nssibi M, Manita G, Korbaa O (2021) Binary Giza pyramids construction for feature selection. Proc Comput Sci 192:676\u2013687","journal-title":"Proc Comput Sci"},{"key":"7285_CR32","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.swevo.2016.02.006","volume":"29","author":"RS Pavithr","year":"2016","unstructured":"Pavithr RS (2016) Quantum Inspired Social Evolution (QSE) algorithm for 0\u20131 knapsack problem. Swarm Evolut Comput 29:33\u201346","journal-title":"Swarm Evolut Comput"},{"issue":"23","key":"7285_CR33","doi-asserted-by":"publisher","first-page":"12711","DOI":"10.1007\/s00500-019-03822-w","volume":"23","author":"LF Plata-Gonz\u00e1lez","year":"2019","unstructured":"Plata-Gonz\u00e1lez LF, Amaya I, Ortiz-Bayliss JC, Conant-Pablos SE, Terashima-Mar\u00edn H, Coello Coello CA (2019) Evolutionary-based tailoring of synthetic instances for the knapsack problem. Soft Comput 23(23):12711\u201312728","journal-title":"Soft Comput"},{"key":"7285_CR34","doi-asserted-by":"crossref","unstructured":"Rezoug A, Bader-El-Den M, Boughaci D (2021) Application of Supervised Machine Learning Methods on the Multidimensional Knapsack Problem. Neural Process Lett pp 1\u201320","DOI":"10.1007\/s11063-021-10662-z"},{"issue":"1","key":"7285_CR35","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s40747-017-0050-z","volume":"4","author":"RM Rizk-Allah","year":"2018","unstructured":"Rizk-Allah RM, Hassanien AE (2018) New binary bat algorithm for solving 0\u20131 knapsack problem. Complex Intell Syst 4(1):31\u201353","journal-title":"Complex Intell Syst"},{"key":"7285_CR36","doi-asserted-by":"publisher","first-page":"10031","DOI":"10.1109\/ACCESS.2022.3142859","volume":"10","author":"TM Shami","year":"2022","unstructured":"Shami TM, El-Saleh AA, Alswaitti M, Al-Tashi Q, Summakieh MA, Mirjalili S (2022) Particle Swarm Optimization: a Comprehensive Survey. IEEE Access 10:10031\u201310061","journal-title":"IEEE Access"},{"key":"7285_CR37","doi-asserted-by":"crossref","unstructured":"Singh RP (2011) Solving 0\u20131 knapsack problem using genetic algorithms. In: 2011 IEEE 3rd International Conference on Communication Software and Networks. pp 591\u2013595","DOI":"10.1109\/ICCSN.2011.6013975"},{"issue":"4","key":"7285_CR38","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2013a simple and efficient heuristic for global optimization over continuous spaces. J Glob optim 11(4):341\u2013359","journal-title":"J Glob optim"},{"issue":"6","key":"7285_CR39","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1007\/s10489-020-01652-0","volume":"50","author":"C Wu","year":"2020","unstructured":"Wu C, Zhao J, Feng Y, Lee M (2020) Solving discounted 0\u20131 knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm. Appl Intell 50(6):1872\u20131888","journal-title":"Appl Intell"},{"issue":"20","key":"7285_CR40","doi-asserted-by":"publisher","first-page":"15409","DOI":"10.1007\/s00500-020-04874-z","volume":"24","author":"H Wu","year":"2020","unstructured":"Wu H, Qian S, Liu Y, Wang D, Guo B (2020) An immune-based response particle swarm optimizer for knapsack problems in dynamic environments. Soft Comput 24(20):15409\u201315425","journal-title":"Soft Comput"},{"issue":"5","key":"7285_CR41","first-page":"11","volume":"169","author":"E Yassien","year":"2017","unstructured":"Yassien E, Masadeh R, Alzaqebah A, Shaheen A (2017) Grey wolf optimization applied to the 0\/1 knapsack problem. Int J Comput Appl 169(5):11\u201315","journal-title":"Int J Comput Appl"},{"key":"7285_CR42","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","volume":"38","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Chen X, Zhou G (2016) An improved monkey algorithm for a 0\u20131 knapsack problem. Appl Soft Comput 38:817\u2013830","journal-title":"Appl Soft Comput"},{"issue":"2","key":"7285_CR43","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11063-015-9465-y","volume":"44","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Li L, Ma M (2016) A complex-valued encoding bat algorithm for solving 0\u20131 knapsack problem. Neural Process Lett 44(2):407\u2013430","journal-title":"Neural Process Lett"},{"issue":"4","key":"7285_CR44","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1504\/IJBIC.2017.087924","volume":"10","author":"H Zhu","year":"2017","unstructured":"Zhu H, He Y, Wang X, Tsang EC (2017) Discrete differential evolutions for the discounted 0\u20131 knapsack problem. Int J Bio-Inspir Comput 10(4):219\u2013238","journal-title":"Int J Bio-Inspir Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07285-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07285-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07285-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T06:46:35Z","timestamp":1664520395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07285-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":44,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["7285"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07285-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}