{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:23:51Z","timestamp":1781105031550,"version":"3.54.1"},"reference-count":39,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,4,1]]},"abstract":"<p>Multidimensional 0-1 Knapsack Problem (MKP) is a well-known integer programming problems. The objective of MKP is to find a subset of items with maximum value satisfying the capacity constraints. A Memetic algorithm on the basis of Design and Implementation Methodology for Metaheuristic Algorithms (DIMMA) is proposed to solve MKP. DIMMA is a new methodology to develop a metaheuristic algorithm. The Memetic algorithm is categorized as metaheuristics and is a particular class of evolutionary algorithms. The parameters of the proposed algorithm are tuned by Design of Experiments (DOE) approach. DOE refers to the process of planning the experiment so that appropriate data that can be analyzed by statistical methods will be collected, resulting in valid and objective conclusions. The proposed algorithm is tested on several MKP standard instances from OR-Library. The results show the efficiency and effectiveness of the proposed algorithm.<\/p>","DOI":"10.4018\/jamc.2012040104","type":"journal-article","created":{"date-parts":[[2012,5,16]],"date-time":"2012-05-16T09:56:40Z","timestamp":1337162200000},"page":"43-55","source":"Crossref","is-referenced-by-count":1,"title":["A DIMMA-Based Memetic Algorithm for 0-1 Multidimensional Knapsack Problem Using DOE Approach for Parameter Tuning"],"prefix":"10.4018","volume":"3","author":[{"given":"Masoud","family":"Yaghini","sequence":"first","affiliation":[{"name":"Iran University of Science and Technology, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohsen","family":"Momeni","sequence":"additional","affiliation":[{"name":"Iran University of Science and Technology, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammadreza","family":"Sarmadi","sequence":"additional","affiliation":[{"name":"Iran University of Science and Technology, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jamc.2012040104-0","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1050.0243"},{"key":"jamc.2012040104-1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-006-0150-4"},{"key":"jamc.2012040104-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.04.015"},{"key":"jamc.2012040104-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.02.002"},{"key":"jamc.2012040104-4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.5.1130"},{"key":"jamc.2012040104-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.08.007"},{"key":"jamc.2012040104-6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009642405419"},{"key":"jamc.2012040104-7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026569813391"},{"key":"jamc.2012040104-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.03.013"},{"key":"jamc.2012040104-9","author":"J.Dreo","year":"2006","journal-title":"Metaheuristics for hard optimization"},{"key":"jamc.2012040104-10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242185"},{"key":"jamc.2012040104-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2007.06.001"},{"key":"jamc.2012040104-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.03.003"},{"key":"jamc.2012040104-13","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00274-1"},{"key":"jamc.2012040104-14","author":"M. R.Garey","year":"1979","journal-title":"Computers and intractability"},{"key":"jamc.2012040104-15","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(86)90048-1"},{"key":"jamc.2012040104-16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1361-8_25"},{"key":"jamc.2012040104-17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00296-8"},{"key":"jamc.2012040104-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.03.046"},{"key":"jamc.2012040104-19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32363-5"},{"key":"jamc.2012040104-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.06.009"},{"key":"jamc.2012040104-21","author":"H.Holland","year":"1975","journal-title":"Adaption in natural and artificial systems"},{"key":"jamc.2012040104-22","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-008-9087-x"},{"key":"jamc.2012040104-23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","author":"H.Kellerer","year":"2004","journal-title":"Knapsack problems"},{"key":"jamc.2012040104-24","author":"D. C.Montgomery","year":"2009","journal-title":"Design and analysis of experiments"},{"key":"jamc.2012040104-25","first-page":"177","article-title":"A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems","author":"P.Moscato","year":"1992","journal-title":"Parallel computing and transputer applications"},{"key":"jamc.2012040104-26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021513321301"},{"key":"jamc.2012040104-27","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2008.916761"},{"key":"jamc.2012040104-28","author":"W. H.Press","year":"1989","journal-title":"Numerical recipes in Pascal: The art of scientific computing"},{"key":"jamc.2012040104-29","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1090.0344"},{"key":"jamc.2012040104-30","first-page":"146","article-title":"Upper bounds for large scale integer quadratic multidimensional knapsack problems.","volume":"4","author":"D.Quadri","year":"2007","journal-title":"International Journal of Operational Research"},{"key":"jamc.2012040104-31","doi-asserted-by":"crossref","unstructured":"Ridge, E., & Kudenko, D. (2007). Tuning the performance of the MMAS heuristic. In Proceedings of the International Workshop on Engineering Stochastic Local Search Algorithms (pp. 46-60).","DOI":"10.1007\/978-3-540-74446-7_4"},{"key":"jamc.2012040104-32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02538-9_11"},{"key":"jamc.2012040104-33","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","author":"E. G.Talbi","year":"2009","journal-title":"Metaheuristics: From design to implementation"},{"key":"jamc.2012040104-34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.01.024"},{"key":"jamc.2012040104-35","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9074-4"},{"key":"jamc.2012040104-36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.11.036"},{"key":"jamc.2012040104-37","doi-asserted-by":"publisher","DOI":"10.4018\/jamc.2010100104"},{"key":"jamc.2012040104-38","doi-asserted-by":"publisher","DOI":"10.4018\/jamc.2011040104"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=67333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T18:26:59Z","timestamp":1654108019000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jamc.2012040104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,4,1]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jamc.2012040104","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,1]]}}}