{"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":1773752211761,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T00:00:00Z","timestamp":1280361600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s12351-010-0084-0","type":"journal-article","created":{"date-parts":[[2010,7,28]],"date-time":"2010-07-28T08:55:32Z","timestamp":1280307332000},"page":"229-252","source":"Crossref","is-referenced-by-count":8,"title":["A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators"],"prefix":"10.1007","volume":"12","author":[{"given":"Mohammad Reza","family":"Bonyadi","sequence":"first","affiliation":[]},{"given":"Xiaodong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,29]]},"reference":[{"key":"84_CR1","unstructured":"Alaya I, Solnon G, Ghedira K (2004) Ant algorithm for the multidimensional knapsack problem. International conference on bio-inspired optimization methods and their applications. BIOMA 2004, pp 63\u201372"},{"key":"84_CR2","doi-asserted-by":"crossref","unstructured":"Alves M, Almeida M (2008) MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem. Comput Oper Res 34(11):3458\u20133470","DOI":"10.1016\/j.cor.2006.02.008"},{"key":"84_CR3","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"},{"issue":"11","key":"84_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"84_CR5","doi-asserted-by":"crossref","unstructured":"Birbil S, Fang SH (2003) An electromagnetism-like mechanism for global optimization. J Glob Optim, Kluwer, vol 25, pp 263\u2013282","DOI":"10.1023\/A:1022452626305"},{"issue":"2","key":"84_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.dam.2009.08.007","volume":"158","author":"S Boussier","year":"2010","unstructured":"Boussier S, Vasquez M, Vimont Y, Hanafi S, Michelon P (2010) A multi-level search strategy for the 01 Multidimensional Knapsack. Discret Appl Math 158(2):97\u2013109","journal-title":"Discret Appl Math"},{"key":"84_CR7","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1016\/j.eswa.2007.11.050","volume":"36","author":"PC Chang","year":"2009","unstructured":"Chang PC, Chen SH, Fan CY (2009) A hybrid electromagnetism-like algorithm for single machine scheduling problem. Expert Syst Appl 36:1259\u20131267","journal-title":"Expert Syst Appl"},{"key":"84_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P Chu","year":"1998","unstructured":"Chu P, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J Heur 4:63\u201386","journal-title":"J Heur"},{"key":"84_CR9","doi-asserted-by":"crossref","unstructured":"Cotta C, Troya JM (1998) \u201cA hybrid genetic algorithm for the 0-1 Multidimensional knapsack problem\u201d, Artificial Neural Nets and Genetic Algorithms, Springer, New York, pp 250\u2013254","DOI":"10.1007\/978-3-7091-6492-1_55"},{"key":"84_CR10","doi-asserted-by":"crossref","unstructured":"Debels D, Vanhoucke M (2004) An electromagnetism meta-heuristic for the resource-constrained project scheduling problem. Published in Lecture notes on Computer Science, vol 3871, pp 259\u2013270","DOI":"10.1007\/11740698_23"},{"key":"84_CR11","doi-asserted-by":"crossref","unstructured":"Debels D, Vanhoucke M (2006) \u201cThe electromagnetism meta-heuristic applied to the resource-constrained project scheduling problem\u201d, Lecture notes in Computer Science, ISSN: 0302-9743, pp 259\u2013270","DOI":"10.1007\/11740698_23"},{"key":"84_CR12","unstructured":"Fidanova S (2002) Evolutionary algorithm for multidimensional knapsack problem. PPSNVII-Workshop"},{"key":"84_CR13","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H.Freeman and company, New York"},{"key":"84_CR14","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. Oper Res 14:1045\u20131075","journal-title":"Oper Res"},{"issue":"2\u20133","key":"84_CR15","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-1 multidimensional Knapsack Problem. Eur J Oper Res 106(2\u20133):659\u2013675","journal-title":"Eur J Oper Res"},{"key":"84_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10852-008-9078-9","volume":"7","author":"S Hanafi","year":"2008","unstructured":"Hanafi S, Wilbaut C (2008) Scatter search for the 0-1 multidimensional knapsack problem. J Math Model Algor 7:143\u2013159. doi: 10.1007\/s10852-008-9078-9","journal-title":"J Math Model Algor"},{"key":"84_CR17","doi-asserted-by":"crossref","unstructured":"Ke L, Feng Z, Ren Z, Wei X (2010) An ant colony optimization approach for the multidimensional knapsack problem. J Heur 16(1):65\u201383. doi 10.1007\/s10732-008-9087-x","DOI":"10.1007\/s10732-008-9087-x"},{"key":"84_CR18","doi-asserted-by":"crossref","unstructured":"Khuri S, Back T, Heitkotter J (1994) The zero\/one multidimensional knapsack problem and genetic algorithms. In: Proceedings of the 1994 ACM symposium on applied computing, pp 188\u2013193","DOI":"10.1145\/326619.326694"},{"key":"84_CR19","unstructured":"Kong M, Tian P (2007) Application of the particle swarm optimization to the multidimensional knapsack problem. Artificial Intelligence and Soft Computing. In: 8th international conference. Proceedings, pp 1140\u20131149"},{"issue":"8","key":"84_CR20","doi-asserted-by":"crossref","first-page":"2672","DOI":"10.1016\/j.cor.2006.12.029","volume":"35","author":"M Kong","year":"2008","unstructured":"Kong M, Tian P, Kao Y (2008) A new ant colony optimization algorithm for the multidimensional Knapsack problem. Comput Oper Res 35(8):2672\u20132683","journal-title":"Comput Oper Res"},{"key":"84_CR21","doi-asserted-by":"crossref","unstructured":"Leguizamon G, Michalewicz Z (1999) A new version of ant system for subset problems. In: Proceedings of the congress on evolutionary computation, pp 1459\u20131464","DOI":"10.1109\/CEC.1999.782655"},{"key":"84_CR22","doi-asserted-by":"crossref","unstructured":"Maenhout B, Vanhoucke M (2007) An electromagnetic meta-heuristic for the nurse scheduling problem. J Heur, Springer, Netherlands, vol 13, no 4, pp 359\u2013385","DOI":"10.1007\/s10732-007-9013-7"},{"key":"84_CR23","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":"84_CR24","doi-asserted-by":"crossref","unstructured":"Naderi B, Tavakkoli-Moghaddam R, Khalili M (2010) Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan. Knowl Based Syst 23(2):77\u201385","DOI":"10.1016\/j.knosys.2009.06.002"},{"issue":"1","key":"84_CR25","first-page":"61","volume":"34","author":"H Pirkul","year":"1987","unstructured":"Pirkul H (1987) A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Res Logist 34(1):61\u201372","journal-title":"Naval Res Logist"},{"key":"84_CR26","unstructured":"Rafael PH, Nikitas D (2003) On the performance of the ant colony system for solving the multidimensional Knapsack problem. In: Proceedings of the IEEE pacific rim conference on communications, computers and signal processing, pp 338\u2013341"},{"key":"84_CR27","doi-asserted-by":"crossref","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 problem. J Oper Res Soc 30:369\u2013378","journal-title":"J Oper Res Soc"},{"key":"84_CR28","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10732-006-4295-8","volume":"12","author":"C Solnon","year":"2006","unstructured":"Solnon C, Fenet S (2006) A study of ACO capabilities for solving the maximum clique problem. J Heur 12:155\u2013180","journal-title":"J Heur"},{"key":"84_CR29","doi-asserted-by":"crossref","DOI":"10.1002\/0471739367","volume-title":"Quantum approach to informatics","author":"S Stenholm","year":"2005","unstructured":"Stenholm S, Suominen KA (2005) Quantum approach to informatics. Wiley, New York"},{"issue":"1","key":"84_CR30","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-1 multidimensional knapsack problem. Eur J Oper Res 165(1):70\u201381","journal-title":"Eur J Oper Res"},{"key":"84_CR31","unstructured":"Wu P, Yang K, Fang H (2006) A revised EM-like algorithm\u00a0+\u00a0K-OPT method for solving the traveling salesman problem. In: Proceedings of the first international conference on innovative computing, information and control. ISBN 0-7695-2616-0\/06"},{"key":"84_CR32","doi-asserted-by":"crossref","first-page":"3427","DOI":"10.1016\/j.eswa.2009.10.005","volume":"37","author":"A Yurtkuran","year":"2010","unstructured":"Yurtkuran A, Emel E (2010) A new hybrid electromagnetism-like algorithm for capacitated vehicle routing problems. Expert Syst Appl 37:3427\u20133433","journal-title":"Expert Syst Appl"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-010-0084-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-010-0084-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-010-0084-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T08:04:34Z","timestamp":1559462674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-010-0084-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,29]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s12351-010-0084-0","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,29]]}}}