Non-dominated Sorting on Two Objectives

اسناد مشابه

• Advanced Pareto Front Non-Dominated Sorting Multi-Objective Particle Swarm Optimization for Optimal Placement and Sizing of Distributed Generation

  سند علمی۲۰۱۶Kumar Mahesh, Perumal Nallagownden, Irraivan Elamvazuthi

  This paper proposes an advanced Pareto-front non-dominated sorting multi-objective particle swarm optimization (Advanced-PFNDMOPSO) method for optimal configuration (placement and sizing) of distributed generation (DG) in the radial distribution system. The distributed generation

• A fast non-dominated sorting multi-objective symbiotic organism search algorithm for energy efficient locomotion of snake robot

  مقاله‌ی دسترسی آزاد۲۰۲۲Computer Science and Information Systems['Yunus Emre Baysal', 'Ismail Hakki Altas', '']

  This paper deals with energy efficient locomotion of a wheel-less snake robot. is very crucial for potential applications untethered robots. The optimum gait parameters the robot are obtained two different multi-objective algorithms based on symbiotic organism search algorithm by

• Advanced Pareto Front Non-Dominated Sorting Multi-Objective Particle Swarm Optimization for Optimal Placement and Sizing of Distributed Generation

  مقاله‌ی دسترسی آزاد۲۰۱۶EnergiesKumarMahesh, PerumalNallagownden, IrraivanElamvazuthi

• Solution of Optimal Power Flow Using Non-Dominated Sorting Multi Objective Based Hybrid Firefly and Particle Swarm Optimization Algorithm

  مقاله‌ی دسترسی آزاد۲۰۲۰EnergiesAbdullahKhan, HashimHizam, Noor IzzriAbdul-Wahab, Mohammad LutfiOthman

• A Multi-Objective Gravitational Search Algorithm Based on Non-Dominated Sorting

  سند علمی۲۰۱۲IJSIRHadi Nobahari, Mahdi Nikusokhan, Patrick Siarry

  This paper proposes an extension of the Gravitational Search Algorithm (GSA) to multi-objective optimization problems. The new algorithm, called Non-dominated Sorting GSA (NSGSA), utilizes the non-dominated sorting concept to update the gravitational acceleration of the particles

• A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II

  سند علمی۲۰۰۰PPSNKalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Meyarivan

  Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) O(mN3) computational complexity (where m is the number of objectives and N is the population size), (ii) non-elitism approach, and (iii) the need for spec