Non-dominated Sorting Genetic Algorithm

Non-dominated Sorting Genetic Algorithm, Nondominated Sorting Genetic Algorithm, Fast Elitist Non-dominated Sorting Genetic Algorithm, NSGA, NSGA-II

Taxonomy

The Non-dominated Sorting Genetic Algorithm is a Multiple Objective Optimization (MOO) algorithm and is an instance of an Evolutionary Algorithm from the field of Evolutionary Computation. Refer to for more information and references on Multiple Objective Optimization. NSGA is an extension of the Genetic Algorithm for multiple objective function optimization. It is related to other Evolutionary Multiple Objective Optimization Algorithms (EMOO) (or Multiple Objective Evolutionary Algorithms MOEA) such as the Vector-Evaluated Genetic Algorithm (VEGA), Strength Pareto Evolutionary Algorithm (SPEA), and Pareto Archived Evolution Strategy (PAES). There are two versions of the algorithm, the classical NSGA and the updated and currently canonical form NSGA-II.

Algoritma Pemrograman & Struktur Data : Linked List

Kali ini kita akan mendiskusikan tentang struktur data ‘Linked List’. Silahkan unduh materi studi disini.

Algoritma Pemrograman & Struktur Data : Stack

Stack atau tumpukan adalah sebuah struktur data dimana data hanya dapat diisi atau dimasukkan dan diambil dari satu sisi saja. Stack bersifat LIFO (Last In First Out). Berikut materi tentang ‘Stack’ bisa diunduh disini.

Week #5 Basic Programming : Selection

Ok…this week (#5) we will discuss about selection process. In this method we can use :

– IF….THEN….

– IF….THEN….ELSE

– CASE …or SELECT CASE…

You can download the file pdf in here.