An Algorithm for Finding Non-dominated Set Based on Two-Dimension Sorting

No abstract is available for this paper.

• Publication year

  2015

• Venue

  International Conference on Bio-Inspired Computing: Theories and Applications

• Publication date

  2015-09-25

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-662-49014-3_14
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Methods for multi-objective optimization: An analysis

  2015cited by this paper
• Multi-Objective BDD Optimization with Evolutionary Algorithms

  2015cited by this paper
• Multi-objective ant colony optimisation-based routing in WSNs

  2014cited by this paper
• A survey on multi-objective evolutionary algorithms for many-objective problems

  2014cited by this paper
• Memetic Immune Algorithm for Multiobjective Optimization: Memetic Immune Algorithm for Multiobjective Optimization

  2014cited by this paper
• Survey of Many-objective Optimization Algorithms

  2014cited by this paper
• Non-dominated sorting genetic algorithm with decomposition to solve constrained optimisation problems

  2013cited by this paper
• Research advance of multi-objective optimization non-dominated set construction methods

  2013cited by this paper
• Attempt to reduce the computational complexity in multi-objective differential evolution algorithms

  2013cited by this paper
• A Fast Bi-Objective Non-Dominated Sorting Algorithm

  2011cited by this paper
• An Indicator for Assessing the Spread of Solutions in Multi-Objective Evolutionary Algorithm: An Indicator for Assessing the Spread of Solutions in Multi-Objective Evolutionary Algorithm

  2011cited by this paper
• A Fast and Effective Method for Pruning of Non-dominated Solutions in Many-Objective Problems

  2006cited by this paper
• Improved Pruning of Non-Dominated Solutions Based on Crowding Distance for Bi-Objective Optimization Problems

  2006cited by this paper
• Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms

  2003cited by this paper
• A fast and elitist multiobjective genetic algorithm: NSGA-II

  2002cited by this paper
• Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

  2000cited by this paper
• The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation

  1999cited by this paper
• Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example

  1998cited by this paper

• No citing papers are available for this paper.