{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:56:51Z","timestamp":1773752211713,"version":"3.50.1"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T00:00:00Z","timestamp":1363305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00607-013-0316-2","type":"journal-article","created":{"date-parts":[[2013,3,13]],"date-time":"2013-03-13T23:39:20Z","timestamp":1363217960000},"page":"897-921","source":"Crossref","is-referenced-by-count":16,"title":["Essential Particle Swarm Optimization queen with Tabu Search for MKP resolution"],"prefix":"10.1007","volume":"95","author":[{"given":"Raida","family":"Ktari","sequence":"first","affiliation":[]},{"given":"Habib","family":"Chabchoub","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,15]]},"reference":[{"issue":"7","key":"316_CR1","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0142-0615(01)00067-9","volume":"24","author":"AM Abido","year":"2002","unstructured":"Abido AM (2002) Optimal power flow using particle swarm optimization. Electr Power Energy Syst 24(7):563\u2013571","journal-title":"Electr Power Energy Syst"},{"issue":"2","key":"316_CR2","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1109\/20.996256","volume":"38","author":"B Brandstatter","year":"2002","unstructured":"Brandstatter B, Baumgartner U (2002) Particle swarm optimization. Mass-spring system analogon. IEEE Trans Magn 38(2):997\u20131000","journal-title":"IEEE Trans Magn"},{"issue":"8","key":"316_CR3","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0141-9331(02)00053-4","volume":"26","author":"A Salman","year":"2002","unstructured":"Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26(8):363\u2013371","journal-title":"Microprocess Microsyst"},{"issue":"3","key":"316_CR4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TEVC.2004.826068","volume":"8","author":"M Wachowiak","year":"2004","unstructured":"Wachowiak M, Smolikova R, Zheng Y, Zurada J, Elmaghraby A (2004) An approach to multimodal biomedical image registration utilizing particle swarm optimization. IEEE Trans Evol Comput 8(3):289\u2013301","journal-title":"IEEE Trans Evol Comput"},{"key":"316_CR5","doi-asserted-by":"crossref","unstructured":"Blackwell T, Bentley PJ (2002) Improvised music with swarms. In: Fogel DB, El-Sharkawi MA, Yao X, Greenwood G, Iba H, Marrow P, Shackleton M (eds) Proceedings of the 2002 Congress on Evolutionary Computation CEC 2002. IEEE Press, pp 1462\u20131467","DOI":"10.1109\/CEC.2002.1004458"},{"key":"316_CR6","volume-title":"Swarm intelligence","author":"J Kennedy","year":"2001","unstructured":"Kennedy J, Eberhart RC, Shi Y (2001) Swarm intelligence. Morgan Kaufmann Publishers, San Francisco"},{"key":"316_CR7","doi-asserted-by":"crossref","unstructured":"Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the 6th International Symposium on Micro Machine and Human Science, pp 39\u201343","DOI":"10.1109\/MHS.1995.494215"},{"key":"316_CR8","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimisation. In: Proceedings of the IEEE International Conference, pp 942\u2013948"},{"key":"316_CR9","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on Systems, Man, and, Cybernetics, pp 4104\u20134109","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"316_CR10","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.1016\/j.asoc.2010.11.013","volume":"11","author":"GC Luh","year":"2011","unstructured":"Luh GC, Lin CY, Lin YS (2011) A binary particle swarm optimization for continuum structural topology optimization. Appl Soft Comput 11:2833\u20132844","journal-title":"Appl Soft Comput"},{"issue":"3","key":"316_CR11","doi-asserted-by":"crossref","first-page":"3260","DOI":"10.1016\/j.asoc.2011.01.002","volume":"11","author":"E Chen","year":"2011","unstructured":"Chen E, Li J, Liuc X (2011) In search of the essential binary discrete particle swarm. Appl Soft Comput 11(3):3260\u20133269","journal-title":"Appl Soft Comput"},{"key":"316_CR12","doi-asserted-by":"crossref","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":"316_CR13","volume-title":"Knapsack problems, algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems, algorithms and computer implementations. Wiley, New York"},{"key":"316_CR14","unstructured":"OR-Library, Beasley JE. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/files\/"},{"issue":"4","key":"316_CR15","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1002\/net.20180","volume":"49","author":"E Angelelli","year":"2007","unstructured":"Angelelli E, Speranza MG, Savelsbergh MWP (2007) Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49(4):308\u2013317","journal-title":"Networks"},{"key":"316_CR16","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2004.01.024","volume":"165","author":"M Vasquez","year":"2005","unstructured":"Vasquez M, Vimont Y (2005) Improved results on the 0\u20131 multidimensional Knapsack problem. Eur J Oper Res 165:70\u201381","journal-title":"Eur J Oper Res"},{"issue":"1","key":"316_CR17","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/opre.15.1.83","volume":"15","author":"HM Weingartner","year":"1967","unstructured":"Weingartner HM, Ness DN (1967) Methods for the solution of the multidimensional 0\/1 Knapsack problem. Oper Res 15(1):83\u2013103","journal-title":"Oper Res"},{"key":"316_CR18","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","volume":"28","author":"D Fayard","year":"1982","unstructured":"Fayard D, Plateau G (1982) An algorithm for the solution of the 0\u20131 Knapsack problem. Computing 28:269\u2013287","journal-title":"Computing"},{"key":"316_CR19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1086\/294081","volume":"28","author":"JH Lorie","year":"1955","unstructured":"Lorie JH, Savage LJ (1955) Three problems in capital rationing. J Bus 28:229\u2013239","journal-title":"J Bus"},{"issue":"2","key":"316_CR20","doi-asserted-by":"crossref","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: an integrated approach using contingent claims analysis and integer programming. Oper Res 49(2):196\u2013206","journal-title":"Oper Res"},{"issue":"6","key":"316_CR21","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"PC Gilmore","year":"1966","unstructured":"Gilmore PC, Gomory RE (1966) The theory and computation of Knapsack functions. Operat Res 14(6):1045\u20131075","journal-title":"Operat Res"},{"key":"316_CR22","doi-asserted-by":"crossref","unstructured":"Shih W (1979) A branch and bound method for the multiconstraint zero\u2013one Knapsack problem. J Oper Res Soc 39:369\u2013378","DOI":"10.1057\/jors.1979.78"},{"key":"316_CR23","first-page":"215","volume-title":"A distributed data processing","author":"B Gavish","year":"1982","unstructured":"Gavish B, Pirkul H (1982) Allocation of databases and processors. In: Akola DJ (ed) A distributed data processing. Management of Distributed Data Processing, North-Holland, pp 215\u2013231"},{"issue":"2","key":"316_CR24","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011203002719","volume":"20","author":"M Vasquez","year":"2001","unstructured":"Vasquez M, Hao JK (2001) A logic-constrained Knapsack formulation and a Tabu algorithm for the daily photograph scheduling of an Earth observation satellite. Comput Optim Appl 20(2):137\u2013157","journal-title":"Comput Optim Appl"},{"key":"316_CR25","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","volume":"31","author":"B Gavish","year":"1985","unstructured":"Gavish B, Pirkul H (1985) Efficient algorithms for solving multiconstraint zero\u2013one Knapsack problems to optimality. Math Program 31:78\u2013105","journal-title":"Math Program"},{"key":"316_CR26","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"E Balas","year":"1980","unstructured":"Balas E, Martin CH (1980) Pivot and complement-A heuristic for 0\u20131 programming. Manag Sci 26:86\u201396","journal-title":"Manag Sci"},{"key":"316_CR27","volume-title":"Taschenbuch der Mathematik","author":"IN Bronstein","year":"1991","unstructured":"Bronstein IN, Semendjajew KA (1991) Taschenbuch der Mathematik. B. G, Teubner, Leipzig"},{"key":"316_CR28","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0377-2217(84)90286-8","volume":"16","author":"MJ Magazine","year":"1984","unstructured":"Magazine MJ, Oguz D (1984) A heuristic algorithm for the multidimensional zero\u2013one Knapsack problem. Eur J Oper Res 16:319\u2013326","journal-title":"Eur J Oper Res"},{"key":"316_CR29","volume-title":"Knapsack problems. Algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems. Algorithms and computer implementations. Wiley, New York"},{"key":"316_CR30","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A","volume":"34","author":"H Pirkul","year":"1987","unstructured":"Pirkul H (1987) A heuristic solution procedure for the multiconstrained zero\u2013one Knapsack problem. Nav Res Logist 34:161\u2013172","journal-title":"Nav Res Logist"},{"key":"316_CR31","doi-asserted-by":"crossref","unstructured":"Volgenant A, Zoon JA (1990) An improved heuristic for multidimensional 0\u20131 Knapsack problems. J Operat Res Soc 41:963\u2013970","DOI":"10.1057\/jors.1990.148"},{"key":"316_CR32","unstructured":"Chu PC (1997) A genetic algorithm approach for combinatorial optimization problems. Ph.D. thesis, The Management School, Imperial College of Science, London"},{"key":"316_CR33","unstructured":"Chu PC, Beasley JE (1997) A genetic algorithm for the multidimensional Knapsack problem. Working paper, The Management School, Imperial College of Science, London"},{"issue":"2","key":"316_CR34","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/S0377-2217(97)00296-8","volume":"106","author":"S Hanafi","year":"1998","unstructured":"Hanafi S, Fr\u00e9ville A (1998) An efficient Tabu search approach for the 0\u20131 multidimensional Knapsack problem. Eur J Oper Res 106(2):659\u2013675","journal-title":"Eur J Oper Res"},{"key":"316_CR35","unstructured":"Alonso CL, Caro F, Montana JL (2005) An evolutionary strategy for the multidimensional 0\u20131 Knapsack problem based on genetic computation of surrogate multipliers. In: Mira J, Alvarez JR (eds) IWINAC 2005. LNCS vol 3562, pp 63\u201373"},{"key":"316_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02242185","volume":"40","author":"A Drexl","year":"1988","unstructured":"Drexl A (1988) A simulated annealing approach to the multiconstraint zero\u2013one Knapsack problem. Computing 40:1\u20138","journal-title":"Computing"},{"key":"316_CR37","unstructured":"Fidanova S (2005) Ant colony optimization for multiple Knapsack problem and model. In: Li BZ et al (eds) NAA 2004. LNCS vol 3401, pp 280\u2013287"},{"key":"316_CR38","unstructured":"Li H, Jiao YC, Zhang L, Gu ZW (2006) Genetic algorithm based on the orthogonal design for multidimensional Knapsack problems. In: Jiao L et al (eds) ICNC 2006. Part I, LNCS vol 4221, pp 696\u2013705"},{"key":"316_CR39","unstructured":"Zhou Y, Kuang Z, Wang J (2008) A chaotic neural network combined heuristic strategy for multidimensional Knapsack problem. In: Kang L et al (eds) ISICA 2008. LNCS vol 5370, pp 715\u2013722"},{"key":"316_CR40","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.1016\/j.cor.2010.02.002","volume":"37","author":"E Angelelli","year":"2010","unstructured":"Angelelli E, Mansini R, Speranza MG (2010) Kernel search: a general heuristic for the multi-dimensional Knapsack problem. Comput Oper Res 37:2017\u20132026","journal-title":"Comput Oper Res"},{"key":"316_CR41","unstructured":"Kong M, Tian P (2006) Apply the particle swarm optimization to the multidimensional Knapsack problem. In: Rutkowski L et al (eds) ICAISC 2006. LNAI vol 4029, pp 1140\u20131149"},{"key":"316_CR42","doi-asserted-by":"crossref","first-page":"28","DOI":"10.4304\/jsw.3.9.28-35","volume":"3","author":"L Wang","year":"2008","unstructured":"Wang L, Wang X, Fu J (2008) A novel probability binary particle swarm optimization algorithm and its application. J Softw 3:28\u201335","journal-title":"J Softw"},{"key":"316_CR43","unstructured":"Wan NF (2008) The particle swarm optimisation algorithm and the 0\u20131 Knapsack problem. MSc thesis, Nottingham Trent University, Nottingham"},{"key":"316_CR44","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/TEVC.2009.2030331","volume":"14","author":"WN Chen","year":"2010","unstructured":"Chen WN, Zhang J, Chung HSH, Zhong WL, Wu WG, Shi Yh (2010) A novel set-based particle swarm optimization method for discrete optimization problems. IEEE Trans Evol Comput 14:278\u2013300","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"316_CR45","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s11047-007-9049-5","volume":"6","author":"A Banks","year":"2007","unstructured":"Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization. Part I: background and development. Nat Comput 6(4):467\u2013484","journal-title":"Nat Comput"},{"issue":"1","key":"316_CR46","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s11047-007-9050-z","volume":"7","author":"A Banks","year":"2007","unstructured":"Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization and indicative applications. Nat Comput 7(1):109\u2013124","journal-title":"Nat Comput"},{"issue":"2\u20133","key":"316_CR47","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.ejps.2004.03.002","volume":"22","author":"Q Shen","year":"2004","unstructured":"Shen Q, Jiang JH, Jiao CX, Shen GL, Yu RQ (2004) Modified particle swarm optimization algorithm for variable selection in MLR And PLS modeling. QSAR studies of antagonism of angiotensin II antagonists. Eur J Pharm Sci 22(2\u20133):145\u2013152","journal-title":"Eur J Pharm Sci"},{"issue":"9","key":"316_CR48","doi-asserted-by":"crossref","first-page":"28","DOI":"10.4304\/jsw.3.9.28-35","volume":"3","author":"L Wang","year":"2008","unstructured":"Wang L, Wang X, Fu J, Zhen L (2008) A novel probability binary particle swarm optimization algorithm and its application. J Softw 3(9):28\u201335","journal-title":"J Softw"},{"issue":"9","key":"316_CR49","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1016\/j.pnsc.2008.03.018","volume":"18","author":"S Lee","year":"2008","unstructured":"Lee S, Soak S, Oh S, Pedrycz W, Jeon M (2008) Modified binary particle swarm optimization. Prog Nat Sci 18(9):1161\u20131166","journal-title":"Prog Nat Sci"},{"issue":"9","key":"316_CR50","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"QK Pan","year":"2008","unstructured":"Pan QK, Tasgetiren MF, Liang YC (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35(9):2807\u20132839","journal-title":"Comput Oper Res"},{"key":"316_CR51","doi-asserted-by":"crossref","unstructured":"Angeline PJ (1998) Evolutionary optimization versus particle swarm optimization: philosophy and performance difference. In: Proceedings of the Evolutionary Programming Conference, San Diego, pp 601\u2013610","DOI":"10.1007\/BFb0040811"},{"issue":"1","key":"316_CR52","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization: an overview. Swarm Intell 1(1):33\u201357","journal-title":"Swarm Intell"},{"key":"316_CR53","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optim","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant Colony Optim. The MIT Press, Cambridge"},{"key":"316_CR54","doi-asserted-by":"crossref","unstructured":"Robinson J, Sinton S, Samii YR (2002) Particle swarm, genetic algorithm, and their hybrids: optimization of a profiled corrugated horn antenna. In: Proceedings of the IEEE International Symposium in Antennas and Propagation Society, pp 314\u2013317","DOI":"10.1109\/APS.2002.1016311"},{"key":"316_CR55","first-page":"1567","volume":"3","author":"H Talbi","year":"2004","unstructured":"Talbi H, Batouche M (2004) Hybrid particle swarm with differential evolution for multimodal image registration. Proc IEEE Int Conf Ind Technol 3:1567\u20131573","journal-title":"Proc IEEE Int Conf Ind Technol"},{"key":"316_CR56","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/ijoc.4.1.32","volume":"4","author":"U Faigle","year":"1992","unstructured":"Faigle U, Kern W (1992) Some convergence results for probabilistic Tabu search. ORSA J Comput 4:32\u201337","journal-title":"ORSA J Comput"},{"key":"316_CR57","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13:533\u2013549","journal-title":"Comput Oper Res"},{"key":"316_CR58","volume-title":"The steepest ascent mildest descent heuristic for combinatorial programming","author":"P Hansen","year":"1986","unstructured":"Hansen P (1986) The steepest ascent mildest descent heuristic for combinatorial programming. Presented at the Congress on Numerical Methods in Combinatorial Optimization, Capri"},{"key":"316_CR59","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search. Part I\u2014ORSA J Comput 1:190\u2013206","journal-title":"Part I\u2014ORSA J Comput"},{"key":"316_CR60","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C Friden","year":"1989","unstructured":"Friden C, Hertz A, de Werra D (1989) STABULUS: a technique for finding stable sets in large graphs with Tabu search. Computing 42:35\u201344","journal-title":"Computing"},{"key":"316_CR61","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search. Part II\u2014ORSA J Comput 2:4\u201332","journal-title":"Part II\u2014ORSA J Comput"},{"key":"316_CR62","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","volume":"11","author":"D Werra de","year":"1989","unstructured":"de Werra D, Hertz A (1989) Tabu search techniques: a tutorial and an application to neural networks. OR Spektrum 11:131\u2013141","journal-title":"OR Spektrum"},{"key":"316_CR63","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/S0377-2217(97)00294-4","volume":"106","author":"K Nanobe","year":"1998","unstructured":"Nanobe K, Ibaraki T (1998) A Tabu search approach to the constrained satisfaction problem as a general problem solver. Eur J Oper Res 106:599\u2013623","journal-title":"Eur J Oper Res"},{"key":"316_CR64","unstructured":"http:\/\/clerc.maurice.free.fr\/pso\/"},{"key":"316_CR65","unstructured":"http:\/\/clerc.maurice.free.fr\/pso\/binary_pso\/simpleBinaryPSO_C.zip"},{"key":"316_CR66","first-page":"1459","volume":"2","author":"G Leguizamon","year":"1999","unstructured":"Leguizamon G, Michalewicz Z (1999) A new version of ant system for subset problems. Proc Congr Evol Comput 2:1459\u20131464","journal-title":"Proc Congr Evol Comput"},{"key":"316_CR67","unstructured":"Alaya I, Solnon C, Gh\u00e9ira K (2004) Ant algorithm for the multidimensional knapsack problem. In: Proceedings of the International Conference on Bio-Inspired Optimization Methods Their Application, pp 63\u201372"},{"key":"316_CR68","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/ijoc.1090.0344","volume":"22","author":"J Puchinger","year":"2010","unstructured":"Puchinger J, Raidl GR, Pferschy U (2010) The multidimensional Knapsack problem: structure and algorithms. INFORMS J Comput 22:250\u2013265","journal-title":"INFORMS J Comput"},{"key":"316_CR69","doi-asserted-by":"crossref","unstructured":"Raidl GR (1998) An improved genetic algorithm for the multiconstrained 0\u20131 knapsack problem. In: Proceedings of the 5th IEEE International Conference on Evolutionary Computation, pp 207\u2013211","DOI":"10.1109\/ICEC.1998.699502"},{"key":"316_CR70","unstructured":"Gottlieb J (1999) On the effectivity of evolutionary algorithms for multidimensional knapsack problems. In: Proceedings of Artificial Evolution: Fourth European Conference, LNCS vol 1829, pp 22\u201337"},{"key":"316_CR71","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1162\/106365605774666886","volume":"13","author":"GR Raidl","year":"2005","unstructured":"Raidl GR, Gottlieb J (2005) Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem. Evol Comput J 13:441\u2013475","journal-title":"Evol Comput J"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-013-0316-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-013-0316-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-013-0316-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T19:55:38Z","timestamp":1562788538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-013-0316-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,15]]},"references-count":71,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["316"],"URL":"https:\/\/doi.org\/10.1007\/s00607-013-0316-2","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,15]]}}}