{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:27:26Z","timestamp":1767652046103,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T00:00:00Z","timestamp":1566950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T00:00:00Z","timestamp":1566950400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["F2016403055"],"award-info":[{"award-number":["F2016403055"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Engineering with Computers"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s00366-019-00853-7","type":"journal-article","created":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T17:07:03Z","timestamp":1567012023000},"page":"745-761","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An efficient binary differential evolution algorithm for the multidimensional knapsack problem"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8683-7570","authenticated-orcid":false,"given":"Yichao","family":"He","sequence":"first","affiliation":[]},{"given":"Xinlu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenbin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jinghong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ning","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,28]]},"reference":[{"key":"853_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"key":"853_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville A (2004) The multidimensional 0\u20131 knapsack problem: an overview. Eur J Oper Res 155:1\u201321","journal-title":"Eur J Oper Res"},{"key":"853_CR3","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1287\/opre.49.2.196.13531","volume":"49","author":"H Meier","year":"2001","unstructured":"Meier H, Christofides N, Salkin G (2001) Capital budgeting under uncertainty\u2014an integrated approach using contingent claims analysis and integer programming. Oper Res 49:196\u2013206","journal-title":"Oper Res"},{"key":"853_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1057\/jors.1979.78","volume":"30","author":"W Shih","year":"1979","unstructured":"Shih W (1979) A branch and bound method for the multiconstraint zero-one knapsack problems. J Oper Res Soc 30:369\u2013378","journal-title":"J Oper Res Soc"},{"key":"853_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1002\/1520-6750(200102)48:1<18::AID-NAV2>3.0.CO;2-7","volume":"48","author":"G Beaujon","year":"2001","unstructured":"Beaujon G, Martin S, McDonald C (2001) Balancing and optimizing a portfolio of r&d projects. Naval Res Log 48:18\u201340","journal-title":"Naval Res Log"},{"key":"853_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-94-017-8044-5_10","volume-title":"Optimization and control methods in industrial engineering and construction","author":"C Wu","year":"2014","unstructured":"Wu C, Wang X, Lin J (2014) Optimizations in project scheduling: a state-of-art survey. In: Xu H, Wang X (eds) Optimization and control methods in industrial engineering and construction. Springer, Dordrecht, pp 161\u2013177"},{"key":"853_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ejor.2006.02.058","volume":"186","author":"S Balev","year":"2008","unstructured":"Balev S, Yanev N, Fr\u00e9ville A, Andonov R (2008) A dynamic programming based reduction procedure for the multidimensional 0\u20131 knapsack problem. Eur J Oper Res 186:63\u201376","journal-title":"Eur J Oper Res"},{"key":"853_CR8","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/ijoc.1090.0344","volume":"22","author":"J Puchinger","year":"2010","unstructured":"Puchinger J, Raidl G, Pferschy U (2010) The multidimensional knapsack problem: structure and algorithms. INFORMS J Comput 22:250\u2013265","journal-title":"INFORMS J Comput"},{"key":"853_CR9","doi-asserted-by":"publisher","first-page":"2111","DOI":"10.1016\/j.cor.2011.10.016","volume":"39","author":"Vincent C Li","year":"2012","unstructured":"Li Vincent C, Liang Yun-Chia, Chang Huan-Fu (2012) Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method. Comput Oper Res 39:2111\u20132121","journal-title":"Comput Oper Res"},{"key":"853_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani R, Raghavan P (1995) Randomized algorithms. Cambridge University Press, Cambridge"},{"key":"853_CR11","volume-title":"Design and analysis of approximation algorithms","author":"Du Ding-zhu","year":"2012","unstructured":"Ding-zhu Du, Ko Ker-I, Xiaodong Hu (2012) Design and analysis of approximation algorithms. Springer, Berlin"},{"key":"853_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P Chu","year":"1998","unstructured":"Chu P, Beasley J (1998) A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4:63\u201386","journal-title":"J Heuristics"},{"key":"853_CR13","first-page":"810","volume":"31","author":"YU Xue-Cai","year":"2008","unstructured":"Xue-Cai YU, ZHANG Tian-Wen (2008) An improved ant algorithm for multidimensional knapsack problem. Chin J Comput 31:810\u2013819","journal-title":"Chin J Comput"},{"key":"853_CR14","first-page":"1121","volume":"26","author":"W Ling","year":"2011","unstructured":"Ling W, Sheng-yao W, Chen F (2011) A hybrid distribution estimation algorithm for solving multidimensional knapsack problem. Control Decis 26:1121\u20131125","journal-title":"Control Decis"},{"key":"853_CR15","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1016\/j.apm.2013.08.009","volume":"38","author":"M Chih","year":"2014","unstructured":"Chih M, Lin CJ, Chern MS, Ouc TY (2014) Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem. Appl Math Model 38:1338\u20131350","journal-title":"Appl Math Model"},{"key":"853_CR16","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.asoc.2014.10.030","volume":"26","author":"M Chih","year":"2015","unstructured":"Chih M (2015) Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem. Appl Soft Comput 26:378\u2013389","journal-title":"Appl Soft Comput"},{"key":"853_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.knosys.2013.04.003","volume":"48","author":"L Wang","year":"2013","unstructured":"Wang L, long Zheng X, yao Wang S (2013) A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem. Knowl Based Syst 48:17\u201323","journal-title":"Knowl Based Syst"},{"key":"853_CR18","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.swevo.2013.09.002","volume":"14","author":"A Mak","year":"2014","unstructured":"Mak A, Amac R, Emgp F (2014) Improved binary artificial fish swarm algorithm for the 0\u20131 multidimensional knapsack problems. Swarm Evol Comput 14:66\u201375","journal-title":"Swarm Evol Comput"},{"issue":"23\u201324","key":"853_CR19","doi-asserted-by":"publisher","first-page":"9788","DOI":"10.1016\/j.apm.2016.06.002","volume":"40","author":"J Liu","year":"2016","unstructured":"Liu J, Wu C, Cao J, Wang X, Teo KL (2016) A binary differential search algorithm for the 0\u20131 multidimensional knapsack problem. Appl Math Model 40(23\u201324):9788\u20139805","journal-title":"Appl Math Model"},{"key":"853_CR20","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.asoc.2016.02.027","volume":"43","author":"X Zhang","year":"2016","unstructured":"Zhang X, Wu C, Li J, Wang X, Yang Z, Lee J-M, Jung K-H (2016) Binary artificial algae algorithm for multidimensional knapsack problems. Appl Soft Comput 43:583\u2013595","journal-title":"Appl Soft Comput"},{"key":"853_CR21","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.swevo.2017.10.008","volume":"39","author":"M Chih","year":"2018","unstructured":"Chih M (2018) Three pseudo-utility ratio-inspired particle swarm optimization with local search for multidimensional knapsack problem. Swarm Evol Comput 39:279\u2013296","journal-title":"Swarm Evol Comput"},{"key":"853_CR22","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 evolutiona simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341\u2013359","journal-title":"J Glob Optim"},{"key":"853_CR23","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1360\/crad20070905","volume":"44","author":"Y He","year":"2007","unstructured":"He Y, Wang X, Kou Y (2007) A binary differential evolution algorithm with hybrid encoding. J Comput Res Dev 44:1476\u20131484","journal-title":"J Comput Res Dev"},{"key":"853_CR24","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 E (2017) Discrete differential evolution for the discounted 0\u20131 knapsack problem. Int J Bio-inspired Comput 10:219\u2013238","journal-title":"Int J Bio-inspired Comput"},{"key":"853_CR25","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","volume":"13","author":"AK Qin","year":"2009","unstructured":"Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13:398\u2013417","journal-title":"IEEE Trans Evol Comput"},{"key":"853_CR26","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1109\/TEVC.2008.2009457","volume":"13","author":"S Das","year":"2009","unstructured":"Das S, Abraham A, Chakraborty UK, Konar A (2009) Differential evolution using a neighborhood-basedmutation operator. IEEE Trans Evol Comput 13:526\u2013553","journal-title":"IEEE Trans Evol Comput"},{"key":"853_CR27","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TEVC.2010.2087271","volume":"15","author":"Y Wang","year":"2011","unstructured":"Wang Y, Cai Z, Zhang Q (2011) Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans Evol Comput 15:55\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"853_CR28","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.artint.2012.01.001","volume":"180\u2013181","author":"Y Yu","year":"2012","unstructured":"Yu Y, Yao X, Zhou Z (2012) On the approximation ability of evolutionary optimization with application to minimum set cover. Artif Intell 180\u2013181:20\u201333","journal-title":"Artif Intell"},{"key":"853_CR29","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1162\/106365602317301763","volume":"10","author":"J Gottlieb","year":"2002","unstructured":"Gottlieb J, Marchiori E, Rossi C (2002) Evolutionary algorithms for the satisifiability problem. Evol Comput 10:35\u201350","journal-title":"Evol Comput"},{"key":"853_CR30","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"TP Runarsson","year":"2000","unstructured":"Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4:284\u2013294","journal-title":"IEEE Trans Evol Comput"},{"key":"853_CR31","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CA Coello","year":"2002","unstructured":"Coello CA (2002) Theoretial and numerical constraint-handling techniques used with evolutionary algorithm\u2014a survey of the state of art. Comput Methods Appl Mech Eng 191:1245\u20131287","journal-title":"Comput Methods Appl Mech Eng"},{"key":"853_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z, Schoenauer M (1996) Evolutionary algorithms for pararmeter optimization problems. Evol Comput 4:1\u201332","journal-title":"Evol Comput"},{"key":"853_CR33","unstructured":"Beasley JE (2017) Orlib-operations research library. http:\/\/people.brunel.ac.uk\/mastjjb\/jeb\/ orlib\/mknapinfo.html"},{"key":"853_CR34","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459\u2013471","journal-title":"J Glob Optim"},{"key":"853_CR35","doi-asserted-by":"crossref","unstructured":"Tan Y, Zhu Y (2010) Fireworks algorithm for optimization. In: International conference in swarm intelligence, pp 355\u2013364","DOI":"10.1007\/978-3-642-13495-1_44"},{"key":"853_CR36","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"853_CR37","first-page":"1","volume":"43","author":"D Haibin","year":"2017","unstructured":"Haibin D, Fei Y (2017) Progresses in pigeon-inspired optimization algorithms. J Beijing Univ Technol (Nat Sci Ed) 43:1\u20137","journal-title":"J Beijing Univ Technol (Nat Sci Ed)"},{"key":"853_CR38","first-page":"2580","volume":"9","author":"Y He","year":"2018","unstructured":"He Y, Wang X, Zhao S, Zhang X (2018) The design and applications of discrete evolutionary algorithms based on encoding transformation. J Softw 9:2580\u20132594","journal-title":"J Softw"}],"container-title":["Engineering with Computers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-019-00853-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00366-019-00853-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-019-00853-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T10:41:15Z","timestamp":1611225675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00366-019-00853-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,28]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["853"],"URL":"https:\/\/doi.org\/10.1007\/s00366-019-00853-7","relation":{},"ISSN":["0177-0667","1435-5663"],"issn-type":[{"type":"print","value":"0177-0667"},{"type":"electronic","value":"1435-5663"}],"subject":[],"published":{"date-parts":[[2019,8,28]]},"assertion":[{"value":"11 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}