A hybrid evolutionary metaheuristics (HEMH) applied on 0/1 multiobjective knapsack problems
暂无分享,去创建一个
[1] Kaisa Miettinen,et al. Nonlinear multiobjective optimization , 1998, International series in operations research and management science.
[2] Andrzej Jaszkiewicz,et al. Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem , 2003, IEEE Trans. Evol. Comput..
[3] Dalessandro Soares Vianna,et al. A GRASP algorithm for the multi-objective knapsack problem , 2004, XXIV International Conference of the Chilean Computer Science Society.
[4] Kalyanmoy Deb,et al. Dynamic multiobjective optimization problems: test cases, approximations, and applications , 2004, IEEE Transactions on Evolutionary Computation.
[5] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..
[6] Carlos García-Martínez,et al. Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report , 2010, Comput. Oper. Res..
[7] Alexandre Plastino,et al. Applications of the DM-GRASP heuristic: a survey , 2008, Int. Trans. Oper. Res..
[8] Lothar Thiele,et al. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.
[9] Micael Gallego,et al. GRASP and path relinking for the max-min diversity problem , 2010, Comput. Oper. Res..
[10] Alexandre Plastino,et al. Hybridization of GRASP Metaheuristics with Data Mining Techniques , 2004, Hybrid Metaheuristics.
[11] Lothar Thiele,et al. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.
[12] Marco Laumanns,et al. SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .
[13] Celso C. Ribeiro,et al. A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..
[14] Qingfu Zhang,et al. MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.
[15] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[16] F. Glover,et al. Fundamentals of Scatter Search and Path Relinking , 2000 .
[17] Andrzej Jaszkiewicz,et al. On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment , 2002, IEEE Trans. Evol. Comput..
[18] Rafael Martí,et al. GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..
[19] Mauricio G. C. Resende,et al. A hybrid multistart heuristic for the uncapacitated facility location problem , 2006, Eur. J. Oper. Res..
[20] S. Binato,et al. Power transmission network design by greedy randomized adaptive path relinking , 2005, IEEE Transactions on Power Systems.
[21] Christian Blum,et al. Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.
[22] Hisao Ishibuchi,et al. Effects of using two neighborhood structures on the performance of cellular evolutionary algorithms for many-objective optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.
[23] Hisao Ishibuchi,et al. Adaptation of Scalarizing Functions in MOEA/D: An Adaptive Scalarizing Function-Based Multiobjective Evolutionary Algorithm , 2009, EMO.
[24] M. Gulnara Baldoquin,et al. Heuristics and metaheuristics approaches used to solve the Rural Postman Problem : A Comparative Case Study , 2003 .
[25] Alexander Thomasian,et al. A GRASP algorithm for the multi-objective knapsack problem , 2004 .
[26] F. Glover,et al. Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.