{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:20:00Z","timestamp":1781104800561,"version":"3.54.1"},"reference-count":42,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10,1]]},"abstract":"<p>This paper proposes a new hybrid tree search algorithm to the Multidimensional Knapsack Problem (MKP) that effectively combines tabu search with a dynamic and adaptive neighborhood search procedure. The authors\u2019 heuristic, based on a filter-and-fan (F&amp;F) procedure, uses a Linear Programming-based Heuristic to generate a starting solution to the F&amp;F process. A tabu search procedure is used to try to enhance the best solution value provided by the F&amp;F method that generates compound moves by a strategically truncated form of tree search. They report the first application of the F&amp;F method to the MKP. Experimental results obtained on a wide set of benchmark problems clearly demonstrate the competitiveness of the proposed method compared to the state-of-the-art heuristic methods.<\/p>","DOI":"10.4018\/jamc.2012100103","type":"journal-article","created":{"date-parts":[[2013,1,29]],"date-time":"2013-01-29T16:25:28Z","timestamp":1359476728000},"page":"43-63","source":"Crossref","is-referenced-by-count":15,"title":["A Filter-and-Fan Metaheuristic for the 0-1 Multidimensional Knapsack Problem"],"prefix":"10.4018","volume":"3","author":[{"given":"Mahdi","family":"Khemakhem","sequence":"first","affiliation":[{"name":"LOGIQ \u2013 ISGI, University of Sfax, Sfax, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boukthir","family":"Haddar","sequence":"additional","affiliation":[{"name":"LOGIQ \u2013 ISGI, University of Sfax, Sfax, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Khalil","family":"Chebil","sequence":"additional","affiliation":[{"name":"LOGIQ \u2013 ISGI, University of Sfax, Sfax, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[{"name":"LAMIH, University of Valenciennes, Valenciennes, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jamc.2012100103-0","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-006-0150-4"},{"key":"jamc.2012100103-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.04.015"},{"key":"jamc.2012100103-2","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-Library: Distributing test problems by electronic mail.","volume":"41","author":"J. E.Beasley","year":"1990","journal-title":"The Journal of the Operational Research Society"},{"key":"jamc.2012100103-3","unstructured":"Boussier, S., Vasquez, M., Vimont, Y., Hanafi, S., & Michelon, P. (2008). Solving the 0-1multidimensional knapsack problem with resolution search. In Proceedings of the Workshop on Applied Combinatorial Optimization, Buenos Aires, Argentina."},{"key":"jamc.2012100103-4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.08.007"},{"key":"jamc.2012100103-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.068"},{"key":"jamc.2012100103-6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009642405419"},{"key":"jamc.2012100103-7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02241754"},{"key":"jamc.2012100103-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.03.003"},{"key":"jamc.2012100103-9","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00274-1"},{"key":"jamc.2012100103-10","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-3448-8"},{"key":"jamc.2012100103-11","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90209-7"},{"key":"jamc.2012100103-12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591863"},{"key":"jamc.2012100103-13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.6.1045"},{"key":"jamc.2012100103-14","doi-asserted-by":"crossref","unstructured":"Glover, F. (1998). A template for scatter search and path relinking. In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, & D. Snyers (Eds.), Selected Papers from the Third European Conference on Artificial Evolution (LNCS 1363, pp. 3-54).","DOI":"10.1007\/BFb0026589"},{"key":"jamc.2012100103-15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1361-8_25"},{"key":"jamc.2012100103-16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"jamc.2012100103-17","doi-asserted-by":"crossref","unstructured":"Glover, F., & Rego, C. (2006). Ejection chain and filter-and-fan methods in combinatorial optimization. 4OR: A Quarterly Journal of Operations Research, 4(4), 263-296.","DOI":"10.1007\/s10288-006-0029-x"},{"key":"jamc.2012100103-18","unstructured":"Green, C. (1967). Two algorithms for solving independent multidimensional knapsack problems (Management Science Report No. 110). Pittsburgh, PA: Carnegie Institute of Technology, Graduate School of Industrial Administration."},{"key":"jamc.2012100103-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.07.006"},{"key":"jamc.2012100103-20","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00296-8"},{"key":"jamc.2012100103-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.03.046"},{"key":"jamc.2012100103-22","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0546-z"},{"key":"jamc.2012100103-23","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00100-4"},{"key":"jamc.2012100103-24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"jamc.2012100103-25","author":"S.Martello","year":"1990","journal-title":"Knapsack problems: Algorithms and computer implementations (Series in Discrete Mathematics and Optimization)"},{"key":"jamc.2012100103-26","unstructured":"Oliva, C., Michelon, P., & Artigues, C. (2001). Constraint and linear programming: Using reduced costs for solving the zero\/one multiple knapsack problem. In Proceedings of the Workshop on Cooperative Solvers in Constraint Programming (pp. 87-98)."},{"key":"jamc.2012100103-27","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021513321301"},{"key":"jamc.2012100103-28","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A"},{"key":"jamc.2012100103-29","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00013-3"},{"key":"jamc.2012100103-30","doi-asserted-by":"crossref","unstructured":"Puchinger, J., Raidl, G., & Pferschy, U. (2006). The core concept for the multidimensional knapsack problem. In Proceedings of 6th European Conference on Evolutionary Computation in Combinatorial Optimization (pp. 195-208).","DOI":"10.1007\/11730095_17"},{"key":"jamc.2012100103-31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.12.035"},{"key":"jamc.2012100103-32","first-page":"309","article-title":"Local search and metaheuristics for the travelling salesman problem","author":"C.Rego","year":"2002","journal-title":"The travelling salesman problem and its variations"},{"key":"jamc.2012100103-33","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0656-7"},{"key":"jamc.2012100103-34","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0666-5"},{"key":"jamc.2012100103-35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.10.003"},{"key":"jamc.2012100103-36","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","article-title":"A branch and bound method for the multiconstraint zero-one knapsack problem.","volume":"30","author":"W.Shih","year":"1979","journal-title":"The Journal of the Operational Research Society"},{"key":"jamc.2012100103-37","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(78)90093-0"},{"key":"jamc.2012100103-38","doi-asserted-by":"publisher","DOI":"10.1051\/ro:2001123"},{"key":"jamc.2012100103-39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.01.024"},{"key":"jamc.2012100103-40","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9074-4"},{"key":"jamc.2012100103-41","doi-asserted-by":"publisher","DOI":"10.1287\/opre.15.1.83"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=74738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:48:38Z","timestamp":1654094918000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jamc.2012100103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,10,1]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"URL":"https:\/\/doi.org\/10.4018\/jamc.2012100103","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,1]]}}}