{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T17:07:36Z","timestamp":1783184856668,"version":"3.54.6"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"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":["Engineering with Computers"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00366-020-01240-3","type":"journal-article","created":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T07:03:03Z","timestamp":1609830183000},"page":"2771-2790","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["An efficient population-based simulated annealing algorithm for 0\u20131 knapsack problem"],"prefix":"10.1007","volume":"38","author":[{"given":"Nima","family":"Moradi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8268-9873","authenticated-orcid":false,"given":"Vahid","family":"Kayvanfar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Majid","family":"Rafiee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"1240_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cie.2019.04.025","volume":"132","author":"M Abdel-Basset","year":"2019","unstructured":"Abdel-Basset M, El-Shahat D, Faris H, Mirjalili S (2019) A binary multi-verse optimizer for 0\u20131 multidimensional knapsack problems with application in interactive multimedia systems. Comput Ind Eng 132:187\u2013206","journal-title":"Comput Ind Eng"},{"key":"1240_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.procs.2019.12.181","volume":"164","author":"M Khemaja","year":"2019","unstructured":"Khemaja M, Khalfallah S (2019) Towards a knapsack model for optimizing e-training services delivery: application to hybrid intelligent tutoring systems. Procedia Comput Sci 164:257\u2013264","journal-title":"Procedia Comput Sci"},{"key":"1240_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ijpe.2017.06.025","volume":"193","author":"M Samavati","year":"2017","unstructured":"Samavati M, Essam D, Nehring M, Sarker R (2017) A methodology for the large-scale multi-period precedence-constrained knapsack problem: an application in the mining industry. Int J Prod Econ 193:12\u201320","journal-title":"Int J Prod Econ"},{"key":"1240_CR4","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.ejor.2016.06.049","volume":"256","author":"J Simon","year":"2017","unstructured":"Simon J, Apte A, Regnier E (2017) An application of the multiple knapsack problem: the self-sufficient marine. Eur J Oper Res 256:868\u2013876","journal-title":"Eur J Oper Res"},{"key":"1240_CR5","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1287\/ijoc.2018.0831","volume":"31","author":"M Fischetti","year":"2019","unstructured":"Fischetti M, Ljubi\u0107 I, Monaci M, Sinnl M (2019) Interdiction games and monotonicity, with application to knapsack problems. INFORMS J Comput 31:390\u2013410","journal-title":"INFORMS J Comput"},{"key":"1240_CR6","first-page":"1","volume":"7","author":"M Khemaja","year":"2016","unstructured":"Khemaja M (2016) Using a knapsack model to optimize continuous building of a hybrid intelligent tutoring system: application to information technology professionals. Int J Hum Cap Inf Technol Prof (IJHCITP) 7:1\u201318","journal-title":"Int J Hum Cap Inf Technol Prof (IJHCITP)"},{"key":"1240_CR7","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:5477\u20135495","journal-title":"Neural Comput Appl"},{"key":"1240_CR8","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cor.2007.09.009","volume":"36","author":"C Bazgan","year":"2009","unstructured":"Bazgan C, Hugot H, Vanderpooten D (2009) Solving efficiently the 0\u20131 multi-objective knapsack problem. Comput Oper Res 36:260\u2013279","journal-title":"Comput Oper Res"},{"key":"1240_CR9","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1023\/A:1009682532542","volume":"6","author":"X Gandibleux","year":"2000","unstructured":"Gandibleux X, Freville A (2000) Tabu search based procedure for solving the 0\u20131 multiobjective knapsack problem: the two objectives case. J Heuristics 6:361\u2013383","journal-title":"J Heuristics"},{"key":"1240_CR10","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1016\/j.cor.2008.03.003","volume":"36","author":"K Fleszar","year":"2009","unstructured":"Fleszar K, Hindi KS (2009) Fast, effective heuristics for the 0\u20131 multi-dimensional knapsack problem. Comput Oper Res 36:1602\u20131607","journal-title":"Comput Oper Res"},{"key":"1240_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu PC, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4:63\u201386","journal-title":"J Heuristics"},{"key":"1240_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1051\/ro\/2015011","volume":"50","author":"AN \u00dcnal","year":"2016","unstructured":"\u00dcnal AN, Kayakutlu G (2016) A Partheno-genetic algorithm for dynamic 0\u20131 multidimensional knapsack problem. RAIRO Oper Res 50:47\u201366","journal-title":"RAIRO Oper Res"},{"key":"1240_CR13","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1016\/j.ejor.2018.10.043","volume":"274","author":"M Dell\u2019Amico","year":"2019","unstructured":"Dell\u2019Amico M, Delorme M, Iori M, Martello S (2019) Mathematical models and decomposition methods for the multiple knapsack problem. Eur J Oper Res 274:886\u2013899","journal-title":"Eur J Oper Res"},{"key":"1240_CR14","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1051\/ro\/2015061","volume":"50","author":"C He","year":"2016","unstructured":"He C, Leung JY, Lee K, Pinedo ML (2016) An improved binary search algorithm for the multiple-choice knapsack problem. RAIRO Oper Res 50:995\u20131001","journal-title":"RAIRO Oper Res"},{"key":"1240_CR15","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.cor.2016.08.006","volume":"77","author":"Y Chen","year":"2017","unstructured":"Chen Y, Hao J-K (2017) An iterated \u201chyperplane exploration\u201d approach for the quadratic knapsack problem. Comput Oper Res 77:226\u2013239","journal-title":"Comput Oper Res"},{"key":"1240_CR16","first-page":"138","volume":"677","author":"D K\u00f6nig","year":"2016","unstructured":"K\u00f6nig D, Lohrey M, Zetzsche G (2016) Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. Algebra Comput Sci 677:138\u2013153","journal-title":"Algebra Comput Sci"},{"key":"1240_CR17","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1111\/j.1475-3995.2009.00701.x","volume":"16","author":"A Bortfeldt","year":"2009","unstructured":"Bortfeldt A, Winter T (2009) A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces. Int Trans Oper Res 16:685\u2013713","journal-title":"Int Trans Oper Res"},{"key":"1240_CR18","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig GB (1957) Discrete-variable extremum problems. Oper Res 5:266\u2013288","journal-title":"Oper Res"},{"key":"1240_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0377-2217(94)00013-3","volume":"87","author":"D Pisinger","year":"1995","unstructured":"Pisinger D (1995) An expanding-core algorithm for the exact 0\u20131 knapsack problem. Eur J Oper Res 87:175\u2013187","journal-title":"Eur J Oper Res"},{"key":"1240_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cor.2016.11.015","volume":"80","author":"F Della Croce","year":"2017","unstructured":"Della Croce F, Salassa F, Scatamacchia R (2017) An exact approach for the 0\u20131 knapsack problem with setups. Comput Oper Res 80:61\u201367","journal-title":"Comput Oper Res"},{"key":"1240_CR21","first-page":"1","volume":"16","author":"A Shaheen","year":"2016","unstructured":"Shaheen A, Sleit A (2016) Comparing between different approaches to solve the 0\/1 knapsack problem. Int J Comput Sci Netw Secur (IJCSNS) 16:1","journal-title":"Int J Comput Sci Netw Secur (IJCSNS)"},{"key":"1240_CR22","first-page":"1","volume":"10","author":"Y Awasthi","year":"2020","unstructured":"Awasthi Y (2020) Contrasting of various algorithmic techniques to solve knapsack 0\u20131 problem. J Syst Integr 10:1\u20139","journal-title":"J Syst Integr"},{"key":"1240_CR23","doi-asserted-by":"publisher","first-page":"e4954","DOI":"10.1002\/cpe.4954","volume":"31","author":"J Shen","year":"2019","unstructured":"Shen J, Shigeoka K, Ino F, Hagihara K (2019) GPU-based branch-and-bound method to solve large 0\u20131 knapsack problems with data-centric strategies. Concurr Comput Pract Exp 31:e4954","journal-title":"Concurr Comput Pract Exp"},{"key":"1240_CR24","doi-asserted-by":"crossref","unstructured":"Shen J, Shigeoka K, Ino F, Hagihara K (2017) An out-of-core branch and bound method for solving the 0\u20131 knapsack problem on a GPU. In: International conference on algorithms and architectures for parallel processing. Springer, pp 254\u2013267","DOI":"10.1007\/978-3-319-65482-9_17"},{"key":"1240_CR25","unstructured":"Kolahan F, Kayvanfar V (2009) A heuristic algorithm approach for scheduling of multi-criteria unrelated parallel machines. In: Proceeding of international conference on industrial and mechanical engineering\u2014ICIME09 (World Academy of Science, Engineering and Technology, WASET), vol 59, pp 102\u2013105"},{"key":"1240_CR26","first-page":"137","volume-title":"Solution to small size 0\u20131 knapsack problem using cohort intelligence with educated approach, socio-cultural inspired metaheuristics","author":"S Sapre","year":"2019","unstructured":"Sapre S, Patel H, Vaishnani K, Thaker R, Shastri AS (2019) Solution to small size 0\u20131 knapsack problem using cohort intelligence with educated approach, socio-cultural inspired metaheuristics. Springer, Berlin, pp 137\u2013149"},{"key":"1240_CR27","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:495\u2013514","journal-title":"Int J Mach Learn Cybern"},{"key":"1240_CR28","doi-asserted-by":"crossref","unstructured":"G\u00f3mez-Herrera F, Ramirez-Valenzuela RA, Ortiz-Bayliss JC, Amaya I, Terashima-Mar\u00edn H (2017) A quartile-based hyper-heuristic for solving the 0\/1 knapsack problem. In: Mexican international conference on artificial intelligence. Springer, pp 118\u2013128","DOI":"10.1007\/978-3-030-02837-4_10"},{"key":"1240_CR29","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1080\/17445760.2017.1314473","volume":"33","author":"F Hu","year":"2018","unstructured":"Hu F (2018) A probabilistic solution discovery algorithm for solving 0\u20131 knapsack problem. Int J Parallel Emerg Distrib Syst 33:618\u2013626","journal-title":"Int J Parallel Emerg Distrib Syst"},{"key":"1240_CR30","doi-asserted-by":"crossref","unstructured":"Gao Y, Zhang F, Zhao Y, Li C (2018) Quantum-inspired wolf pack algorithm to solve the 0\u20131 knapsack problem. In: Mathematical problems in engineering, 2018","DOI":"10.1155\/2018\/5327056"},{"key":"1240_CR31","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s12293-019-00288-z","volume":"12","author":"S Zhan","year":"2020","unstructured":"Zhan S, Wang L, Zhang Z, Zhong Y (2020) Noising methods with hybrid greedy repair operator for 0\u20131 knapsack problem. Memet Comput 12:37\u201350","journal-title":"Memet Comput"},{"key":"1240_CR32","doi-asserted-by":"publisher","first-page":"2179","DOI":"10.3233\/IFS-141500","volume":"28","author":"TK Truong","year":"2015","unstructured":"Truong TK, Li K, Xu Y, Ouyang A, Nguyen TT (2015) Solving 0\u20131 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy. J Intell Fuzzy Syst 28:2179\u20132186","journal-title":"J Intell Fuzzy Syst"},{"key":"1240_CR33","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 G-G, Deb S, Lu M, Zhao X-J (2017) Solving 0\u20131 knapsack problem by a novel binary monarch butterfly optimization. Neural Comput Appl 28:1619\u20131634","journal-title":"Neural Comput Appl"},{"key":"1240_CR34","doi-asserted-by":"publisher","unstructured":"Abdel-Basset M, Mohamed R, Mirjalili S (2020) A Binary Equilibrium Optimization Algorithm for 0\u20131 Knapsack Problems. Comput Ind Eng 106946. https:\/\/doi.org\/10.1016\/j.cie.2020.106946","DOI":"10.1016\/j.cie.2020.106946"},{"key":"1240_CR35","doi-asserted-by":"publisher","unstructured":"Abdel-Basset M, Mohamed R, Chakrabortty RK, Ryan M, Mirjalili S (2020) New binary marine predators optimization algorithm for 0\u20131 knapsack problems. Comput Ind Eng 106949. https:\/\/doi.org\/10.1016\/j.cie.2020.106949","DOI":"10.1016\/j.cie.2020.106949"},{"key":"1240_CR36","doi-asserted-by":"crossref","first-page":"9959","DOI":"10.1016\/j.amc.2013.04.023","volume":"219","author":"X Zhang","year":"2013","unstructured":"Zhang X, Huang S, Hu Y, Zhang Y, Mahadevan S, Deng Y (2013) Solving 0\u20131 knapsack problems based on amoeboid organism algorithm. Appl Math Comput 219:9959\u20139970","journal-title":"Appl Math Comput"},{"key":"1240_CR37","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s10489-016-0822-y","volume":"46","author":"KK Bhattacharjee","year":"2017","unstructured":"Bhattacharjee KK, Sarmah SP (2017) Modified swarm intelligence based techniques for the knapsack problem. Appl Intell 46:158\u2013179","journal-title":"Appl Intell"},{"key":"1240_CR38","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:31\u201353","journal-title":"Complex Intell Syst"},{"key":"1240_CR39","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:1582\u20131595","journal-title":"Appl Intell"},{"key":"1240_CR40","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/s10489-016-0855-2","volume":"46","author":"Y Zhou","year":"2017","unstructured":"Zhou Y, Bao Z, Luo Q, Zhang S (2017) A complex-valued encoding wind driven optimization for the 0\u20131 knapsack problem. Appl Intell 46:684\u2013702","journal-title":"Appl Intell"},{"key":"1240_CR41","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:407\u2013430","journal-title":"Neural Process Lett"},{"key":"1240_CR42","doi-asserted-by":"publisher","first-page":"5337","DOI":"10.1016\/j.eswa.2015.02.015","volume":"42","author":"X Kong","year":"2015","unstructured":"Kong X, Gao L, Ouyang H, Li S (2015) A simplified binary harmony search algorithm for large scale 0\u20131 knapsack problems. Expert Syst Appl 42:5337\u20135355","journal-title":"Expert Syst Appl"},{"key":"1240_CR43","first-page":"1096","volume":"14","author":"E Sonuc","year":"2016","unstructured":"Sonuc E, Sen B, Bayir S (2016) A parallel approach for solving 0\/1 knapsack problem using simulated annealing algorithm on CUDA platform. Int J Comput Sci Inf Secur 14:1096","journal-title":"Int J Comput Sci Inf Secur"},{"key":"1240_CR44","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"},{"key":"1240_CR45","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s12351-016-0240-2","volume":"17","author":"H Sajedi","year":"2017","unstructured":"Sajedi H, Razavi SF (2017) DGSA: discrete gravitational search algorithm for solving knapsack problem. Oper Res Int J 17:563\u2013591","journal-title":"Oper Res Int J"},{"key":"1240_CR46","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12293-017-0244-3","volume":"11","author":"L Feng","year":"2019","unstructured":"Feng L, Gupta A, Ong Y-S (2019) Compressed representation for higher-level meme space evolution: a case study on big knapsack problems. Memet Comput 11:3\u201317","journal-title":"Memet Comput"},{"key":"1240_CR47","first-page":"1833","volume":"14","author":"L Zhang","year":"2018","unstructured":"Zhang L, Lv J (2018) A heuristic algorithm based on expectation efficiency for 0\u20131 knapsack problem. Int J Innov Comput Inf Control 14:1833\u20131854","journal-title":"Int J Innov Comput Inf Control"},{"key":"1240_CR48","doi-asserted-by":"publisher","first-page":"54447","DOI":"10.1109\/ACCESS.2018.2872533","volume":"6","author":"S-H Zhan","year":"2018","unstructured":"Zhan S-H, Zhang Z-J, Wang L-J, Zhong Y-W (2018) List-based simulated annealing algorithm with hybrid greedy repair and optimization operator for 0\u20131 knapsack problem. IEEE Access 6:54447\u201354458","journal-title":"IEEE Access"},{"key":"1240_CR49","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1504\/IJBIC.2018.090080","volume":"11","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, Zhou Y (2018) An elite opposition-flower pollination algorithm for a 0\u20131 knapsack problem. Int J Bio-Inspired Comput 11:46\u201353","journal-title":"Int J Bio-Inspired Comput"},{"key":"1240_CR50","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s12293-016-0211-4","volume":"10","author":"Y Feng","year":"2018","unstructured":"Feng Y, Yang J, Wu C, Lu M, Zhao X-J (2018) Solving 0\u20131 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation. Memet Comput 10:135\u2013150","journal-title":"Memet Comput"},{"key":"1240_CR51","doi-asserted-by":"crossref","unstructured":"Li J, Li W (2018) A new quantum evolutionary algorithm in 0-1 knapsack problem. In: International symposium on intelligence computation and applications. Springer, pp 142\u2013151","DOI":"10.1007\/978-981-13-6473-0_13"},{"key":"1240_CR52","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 (2018) Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0\u20131 knapsack problem. Comput Electr Eng 67:454\u2013468","journal-title":"Comput Electr Eng"},{"key":"1240_CR53","doi-asserted-by":"crossref","unstructured":"Nouioua M, Li Z, Jiang S (2018) New binary artificial bee colony for the 0\u20131 knapsack problem. In: International conference on swarm intelligence. Springer, pp 153\u2013165","DOI":"10.1007\/978-3-319-93815-8_16"},{"key":"1240_CR54","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.jpdc.2018.08.003","volume":"122","author":"P Buayen","year":"2018","unstructured":"Buayen P, Werapun J (2018) Parallel time\u2013space reduction by unbiased filtering for solving the 0\/1-knapsack problem. J Parallel Distrib Comput 122:195\u2013208","journal-title":"J Parallel Distrib Comput"},{"key":"1240_CR55","doi-asserted-by":"publisher","first-page":"137251","DOI":"10.1109\/ACCESS.2019.2942340","volume":"7","author":"Y Huang","year":"2019","unstructured":"Huang Y, Wang P, Li J, Chen X, Li T (2019) A binary multi-scale quantum harmonic oscillator algorithm for 0\u20131 knapsack problem with genetic operator. IEEE Access 7:137251\u2013137265","journal-title":"IEEE Access"},{"key":"1240_CR56","doi-asserted-by":"crossref","unstructured":"Xue J, Xiao J, Zhu J (2019) Binary fireworks algorithm for 0\u20131 knapsack problem. In: 2019 international conference on artificial intelligence and advanced manufacturing (AIAM). IEEE, pp 218\u2013222","DOI":"10.1109\/AIAM48774.2019.00051"},{"key":"1240_CR57","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 MJ (2019) Solving the 0\u20131 knapsack problem by using tissue P system with cell division. IEEE Access 7:66055\u201366067","journal-title":"IEEE Access"},{"key":"1240_CR58","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":"1240_CR59","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P Czyz\u017cak","year":"1998","unstructured":"Czyz\u017cak P, Jaszkiewicz A (1998) Pareto simulated annealing\u2014a metaheuristic technique for multiple-objective combinatorial optimization. J Multi-Criteria Decis Anal 7:34\u201347","journal-title":"J Multi-Criteria Decis Anal"},{"key":"1240_CR60","doi-asserted-by":"crossref","unstructured":"Nahar S, Sahni S, Shragowitz E (1986) Simulated annealing and combinatorial optimization. In: 23rd ACM\/IEEE design automation conference. IEEE, pp 293\u2013299","DOI":"10.1109\/DAC.1986.1586103"},{"key":"1240_CR61","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/72.363466","volume":"6","author":"PP Yip","year":"1995","unstructured":"Yip PP, Pao Y-H (1995) Combinatorial optimization with use of guided evolutionary simulated annealing. IEEE Trans Neural Netw 6:290\u2013295","journal-title":"IEEE Trans Neural Netw"},{"key":"1240_CR62","volume-title":"Handbook of metaheuristics","author":"FW Glover","year":"2006","unstructured":"Glover FW, Kochenberger GA (2006) Handbook of metaheuristics. Springer Science & Business Media, Berlin"},{"key":"1240_CR63","doi-asserted-by":"crossref","unstructured":"Kort BW, Bertsekas DP (1972) A new penalty function method for constrained minimization. In: Proceedings of the 1972 IEEE conference on decision and control and 11th symposium on adaptive processes. IEEE, pp 162\u2013166","DOI":"10.1109\/CDC.1972.268971"},{"key":"1240_CR64","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-1-4419-1665-5_21","volume-title":"Comparison of metaheuristics, Handbook of metaheuristics","author":"J Silberholz","year":"2010","unstructured":"Silberholz J, Golden B (2010) Comparison of metaheuristics, Handbook of metaheuristics. Springer, Berlin, pp 625\u2013640"},{"issue":"1","key":"1240_CR65","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jmsy.2017.05.004","volume":"44","author":"V Kayvanfar","year":"2017","unstructured":"Kayvanfar V, Moattar Husseini SM, Karimi B, Sajadieh MS (2017) Bi-objective intelligent water drops algorithm to a practical multi-echelon supply chain optimization problem. J Manuf Syst 44(1):93\u2013114","journal-title":"J Manuf Syst"},{"issue":"2","key":"1240_CR66","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1142\/S0219622016500024","volume":"15","author":"E Teymourian","year":"2016","unstructured":"Teymourian E, Kayvanfar V, Komaki GHM, Khodarahmi M (2016) An enhanced intelligent water drops algorithm for scheduling of an agile manufacturing system. Int J Inf Technol Decis Mak 15(2):239\u2013266","journal-title":"Int J Inf Technol Decis Mak"},{"key":"1240_CR67","doi-asserted-by":"crossref","unstructured":"Shahdi-Pashaki S, Teymourian E, Kayvanfar V, Komaki GHM, Sajadi A (2015) Group technology-based model and cuckoo optimization algorithm for resource allocation in cloud computing. In: Proceedings of 15th IFAC symposium on information control problems in manufacturing, Ottawa, Canada, May 2015","DOI":"10.1016\/j.ifacol.2015.06.237"}],"container-title":["Engineering with Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-020-01240-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00366-020-01240-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-020-01240-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T21:24:45Z","timestamp":1698528285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00366-020-01240-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,5]]},"references-count":67,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1240"],"URL":"https:\/\/doi.org\/10.1007\/s00366-020-01240-3","relation":{},"ISSN":["0177-0667","1435-5663"],"issn-type":[{"value":"0177-0667","type":"print"},{"value":"1435-5663","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,5]]},"assertion":[{"value":"12 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors reported no potential conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}