{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:39Z","timestamp":1759667799368,"version":"3.41.0"},"reference-count":46,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1051\/ro\/2015011","type":"journal-article","created":{"date-parts":[[2015,4,24]],"date-time":"2015-04-24T06:36:38Z","timestamp":1429857398000},"page":"47-66","source":"Crossref","is-referenced-by-count":6,"title":["A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem"],"prefix":"10.1051","volume":"50","author":[{"given":"Ali Nadi","family":"\u00dcnal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fclg\u00fcn","family":"Kayakutlu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2015,10,7]]},"reference":[{"key":"R1","unstructured":"Ahmed Z. and Younas I., A dynamic programming based ga for 0-1 modified knapsack problem. Published by Foundation of Computer Science.Int. J. Comput. Appl.16(2011) 1\u20136."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"J.-C. Bai, H.-Y. Chang and Y. Yi, A partheno-genetic algorithm for multidimensional knapsack problem. In Vol. 5,Proc. of 2005 International Conference on Machine Learning and Cybernetics(2005), 2962\u20132965.","DOI":"10.1109\/ICMLC.2005.1527449"},{"key":"R3","unstructured":"O. Basir, Abdunnaser Younes, S. Areibi and P. Calamai, Adapting genetic algorithms for combinatorial optimization problems in dynamic environments. In Chap. 11,Advances in Evolutionary Algorithms, edited by Witold Kosinski. I-Tech Education and Publishing, Vienna (2008) 207\u2013230."},{"key":"R4","unstructured":"Baykaso\u01e7lu A. and Burcin Ozsoydan F., An improved firefly algorithm for solving dynamic multidimensional knapsack problems.Expert Syst. Appl.41(2014) 3712\u20133725."},{"key":"R5","unstructured":"T. Blickle and L. Thiele,A comparison of selection schemes used in genetic algorithms. Technical report, Computer Engineering and Communication Networks Lab (TIK), Swiss Federal Institute of Technology (ETH) (1995)."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Blum C. and Roli A., Metaheuristics in combinatorial optimization.ACM Comput. Surveys35(2003) 268\u2013308.","DOI":"10.1145\/937503.937505"},{"key":"R7","unstructured":"Boussa\u00efd I., Lepagnot J. and Siarry P., A survey on optimization metaheuristics.Inform. Sci.237(2013) 82\u2013117."},{"key":"R8","unstructured":"Boussier S., Vasquez M., Vimont Y., Hanafi S. and Michelon P., A multi-level search strategy for the 0\u20131 Multidimensional Knapsack Problem.Discrete Appl. Math.158(2010) 97\u2013109."},{"key":"R9","unstructured":"J. Branke, M. Orbay\u0131 and\u015e. Uyar, The Role of Representations in Dynamic Knapsack Problems. InApplications of Evolutionary Computing SE - 74, edited by F. Rothlauf, J. Branke, S. Cagnoni, E. Costa, C. Cotta, R. Drechsler, E. Lutton, P. Machado, J.H. Moore, J. Romero, G.D. Smith, G. Squillero and H. Takagi. Vol. 3907 ofLect. Notes Comput. Sci.Springer, Berlin, Heidelberg (2006) 764\u2013775."},{"key":"R10","unstructured":"Chang P.-C. and Chen S.-H., The development of a sub-population genetic algorithm II (SPGA II) for multi-objective combinatorial problems.Appl. Soft Comput.9(2009) 173\u2013181."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Chu P.C. and Beasley J.E., A Genetic Algorithm for the Multidimensional Knapsack Problem.J. Heuristics4(1998) 63\u201386.","DOI":"10.1023\/A:1009642405419"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing. SpringerVerlag (2003).","DOI":"10.1007\/978-3-662-05094-1"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Elkihel M., Boyer V. and El Baz D., Solution of multidimensional knapsack problems via cooperation of dynamic programming and branch and bound.Eur. J. Ind. Eng.4(2010) 434\u2013449.","DOI":"10.1504\/EJIE.2010.035653"},{"key":"R14","unstructured":"M. Ersen Berberler, Guler A. and Nur\u0131yev U.G., A geneti algorithm to solve the multidimensional knapsack problem.Math. Comput. Appl.18(2013) 486\u2013494."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"M. Gen and R. Cheng, Genetic Algorithms and Engineering Optimization. John Wiley and Sons Inc., New York, USA (2000).","DOI":"10.1002\/9780470172261"},{"key":"R16","unstructured":"M. Haluk Akin,New heuristics for the 0-1 multi-dimensional knapsack problems. Ph.D. thesis, University of Central Florida, Ann Arbor (2009)."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Hanafi S. and Wilbaut C., Scatter Search for the 0\u20131 Multidimensional Knapsack Problem.J. Math. Model. Algorithms7(2008) 143\u2013159.","DOI":"10.1007\/s10852-008-9078-9"},{"key":"R18","unstructured":"Hanafi S. and Wilbaut C., Improved convergent heuristics for the 0-1 multidimensional knapsack problem.Ann. Oper. Res.183(2011) 125\u2013142."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"D. Hu and Z. Yao, Stacker-reclaimer scheduling for raw material yard operation. InThird International Workshop on Advanced Computational Intelligence (IWACI)(2010) 432\u2013436.","DOI":"10.1109\/IWACI.2010.5585235"},{"key":"R20","unstructured":"Jalali Varnamkhasti M., Overview of the Algorithms for Solving the Multidimensional Knapsack Problems.Adv. Stud. Biol.4(2012) 37\u201347."},{"key":"R21","unstructured":"Jin Y. and Branke J., Evolutionary Optimization in Uncertain Environments \u2013 A Survey.IEEE Trans. Evol. Comput.9(2005) 303\u2013317."},{"key":"R22","unstructured":"Jo\u00e3o Alves M. and Almeida M., MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem.Comput. Oper. Res.34(2007) 3458\u20133470."},{"key":"R23","unstructured":"Kang F., Li J.-J. and Xu Q., Virus coevolution partheno-genetic algorithms for optimal sensor placement.Adv. Eng. Inform.22(2008) 362\u2013370."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"H. Kellerer, U. Pferschy and D. Pisinger, Multidimensional Knapsack Problems. InKnapsack Problems SE - 9. Springer, Berlin, Heidelberg (2004) 235\u2013283.","DOI":"10.1007\/978-3-540-24777-7_9"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"S. Khuri, T. B\u00e4ck and J. Heitk\u00f6tter, The zero\/one multiple knapsack problem and genetic algorithms. InProc. of the 1994 ACM Symposium on Applied Computing. SAC \u201994. ACM, New York, NY, USA (1994) 188\u2013193.","DOI":"10.1145\/326619.326694"},{"key":"R26","doi-asserted-by":"crossref","unstructured":"Langeveld J. and Engelbrecht A.P., Set-based particle swarm optimization applied to the multidimensional knapsack problem.Swarm Intelligence6(2012) 297\u2013342.","DOI":"10.1007\/s11721-012-0073-4"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"M. Mitchell, An Introduction to Genetic Algorithms. MIT Press, Cambridge, MA, USA (1998).","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"R28","unstructured":"D.C. Montgomery and G.C. Runger, Applied Statistics and Probability for Engineers. John Wiley and Sons (2003)."},{"key":"R29","doi-asserted-by":"crossref","unstructured":"N. Mori and H. Kita, Genetic algorithms for adaptation to dynamic environments-a survey. Inthe 26th Annual Conference of the IEEE Industrial Electronics Society(2000) 2947\u20132952.","DOI":"10.1109\/IECON.2000.972466"},{"key":"R30","doi-asserted-by":"crossref","unstructured":"G.R. Raidl, An improved genetic algorithm for the multiconstrained 0-1 knapsack problem. InProc. of the 1998 IEEE International Conference on Evolutionary Computation. IEEE Press (1998) 207\u2013211.","DOI":"10.1109\/ICEC.1998.699502"},{"key":"R31","unstructured":"Ribeiro C.C., Martins S.L. and Rosseti I., Metaheuristics for optimization problems in computer communications.Comput. Commun.30(2007) 656\u2013669."},{"key":"R32","doi-asserted-by":"crossref","unstructured":"Sakawa Masatoshi and Kato Kosuke, Genetic algorithms with double strings for 0\u20131 programming problems.Eur. J. Oper. Res.144(2003) 581\u2013597.","DOI":"10.1016\/S0377-2217(02)00149-2"},{"key":"R33","unstructured":"Shih Wei, A branch and bound method for the multiconstraint zero-one knapsack problem.J. Oper. Res. Soc.30(1979) 37\u201347."},{"key":"R34","doi-asserted-by":"crossref","unstructured":"Ren Shuai, Wang Jing and Xuejun Zhang, Research on chaos partheno-genetic algorithm for TSP. In vol. 1,International Conference on Computer Application and System Modeling(ICCASM) (2010) V1\u2013290\u2013V1\u2013293.","DOI":"10.1109\/ICCASM.2010.5619417"},{"key":"R35","unstructured":"A. Sim\u00f5es and E. Costa, Using genetic algorithms to deal with dynamic environments: A comparative study of several approaches based on promoting diversity. InProc. of the genetic and evolutionary computation conference GECCO\u201902. Morgan Kaufmann Publishers, New York, NY, USA (2002)."},{"key":"R36","unstructured":"S.N. Sivanandam and S.N. Dipa, Introduction to Genetic Algorithms. Springer-Verlag, Berin (2008)."},{"key":"R37","doi-asserted-by":"crossref","unstructured":"Thanh Nguyen Trung, Yang Shengxiang and Branke Juergen, Evolutionary dynamic optimization: A survey of the state of the art.Swarm Evol. Comput.6(2012) 1\u201324.","DOI":"10.1016\/j.swevo.2012.05.001"},{"key":"R38","doi-asserted-by":"crossref","unstructured":"Turkensteen M., Ghosh D., Goldengorin B. and Sierksma G., Iterative patching and the asymmetric traveling salesman problem. The Traveling Salesman Problem.Discrete Optimization3(2006) 63\u201377.","DOI":"10.1016\/j.disopt.2005.10.005"},{"key":"R39","unstructured":"A.N. \u00dcnal, A Genetic Algorithm for the Multiple Knapsack Problem in Dynamic Environment. InProc. of the World Congress on Engineering and Computer Science 2013. IAENG, San Francicso, USA (2013) 1162."},{"key":"R40","doi-asserted-by":"crossref","unstructured":"\u015e. Uyar and H. Turgut Uyar, A Critical Look at Dynamic Multi-dimensional Knapsack Problem Generation. In Applications of Evolutionary Computing SE - 86. Vol. 5484 ofLect. Notes Comput. Sci.Edited by M. Giacobini, A. Brabazon, S. Cagnoni, G.A. Caro, A. Ek\u00e1rt, A. Esparcia-Alc\u00e1zar, M. Farooq, A. Fink and P. Machado. Springer, Berlin, Heidelberg (2009) 762\u2013767.","DOI":"10.1007\/978-3-642-01129-0_86"},{"key":"R41","doi-asserted-by":"crossref","unstructured":"Vasquez M. and Vimont Yannick, Improved results on the 0\u20131 multidimensional knapsack problem.Eur. J. Oper. Res.165(2005) 70\u201381.","DOI":"10.1016\/j.ejor.2004.01.024"},{"key":"R42","doi-asserted-by":"crossref","unstructured":"J. Wu, A parthenogenetic algorithm for haplotyping a single individual based on WMLF model. InEighth International Conference on Natural Computation(ICNC) (2012) 622\u2013626.","DOI":"10.1109\/ICNC.2012.6234676"},{"key":"R43","unstructured":"Wu J. and Wang H., A parthenogenetic algorithm for the founder sequence reconstruction problem.J. Comput.8(2013) 2934\u20132941."},{"key":"R44","unstructured":"Wu J., Wang J. and Chen J., A parthenogenetic algorithm for single individual {SNP} haplotyping.Eng. Appl. Artif. Intell.22(2009) 401\u2013406."},{"key":"R45","doi-asserted-by":"crossref","unstructured":"Shengxiang Yang, Memory-based immigrants for genetic algorithms in dynamic environments. InProc. of the 2005 conference on Genetic and evolutionary computation \u2013 GECCO \u201905. ACM Press, New York, USA (2005) 1115.","DOI":"10.1145\/1068009.1068196"},{"key":"R46","unstructured":"Yuan Q. and Yang Z., On the performance of a hybrid genetic algorithm in dynamic environments.Appl. Math. Comput.219(2013) 11408\u201311413."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015011\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T22:11:53Z","timestamp":1747951913000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,7]]},"references-count":46,"journal-issue":{"issue":"1"},"alternative-id":["ro150011"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2015011","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"1290-3868"}],"subject":[],"published":{"date-parts":[[2015,10,7]]}}}