A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D
Authors:
- Muhammad Asif JanMJMuhammad Asif Jan
- Rashida Adeeb KhanumRKRashida Adeeb Khanum
Top Cited Papers
- 1 January 2013
- journal article
- Published by Elsevier in Applied Soft Computing
- Vol. 13 (1) , 128-148
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Infeasibility Driven Evolutionary Algorithm for Constrained Optimization2009
- Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-IIIEEE Transactions on Evolutionary Computation, 2008
- MOEA/D: A Multiobjective Evolutionary Algorithm Based on DecompositionIEEE Transactions on Evolutionary Computation, 2007
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experimentIEEE Transactions on Evolutionary Computation, 2002
- Stochastic ranking for constrained evolutionary optimizationIEEE Transactions on Evolutionary Computation, 2000
- Multiobjective programming using uniform design and genetic algorithmIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2000
- A multi-objective genetic local search algorithm and its application to flowshop schedulingIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 1998
- Optimality and non-scalar-valued performance criteriaIEEE Transactions on Automatic Control, 1963
- The computational algorithm for the parametric objective functionNaval Research Logistics Quarterly, 1955