Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- 24 February 2011
- journal article
- Published by Springer Nature in Optimization Letters
- Vol. 6 (4) , 665-678
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A multi-objective genetic algorithm for the design of pressure swing adsorptionEngineering Optimization, 2009
- Solving Three-Objective Optimization Problems Using a New Hybrid Cellular Genetic AlgorithmLecture Notes in Computer Science, 2008
- A survey of recent developments in multiobjective optimizationAnnals of Operations Research, 2007
- Design Issues in a Multiobjective Cellular Genetic Algorithm2007
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz ConstantsSIAM Journal on Optimization, 2006
- The normalized normal constraint method for generating the Pareto frontierStructural and Multidisciplinary Optimization, 2003
- Global optimization based on a statistical model and simplicial partitioningComputers & Mathematics with Applications, 2002
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimizationComputers & Mathematics with Applications, 2002
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999