Non-dominated Sorting on Two Objectives

PDF

Authors
  1. Mazurek, M.
  2. Wesolkowski, S.
Corporate Authors
Defence R&D Canada - Centre for Operational Research and Analysis, Ottawa ON (CAN)
Abstract
The fast and elitist non-dominated sorting genetic algorithm (NSGA-II) contains a mechanism to sort individuals in a multi-objective optimization problem into non-dominated fronts, based on their performance in each optimization variable. When dealing with a bi-objective problem it is possible to carry-out the non-dominated sorting more efficiently, using the new sorting method presented in this paper. Results comparing the efficiency of the two sorting mechanisms on sets of data with two objectives are presented and discussed.
Report Number
DRDC-CORA-TN-2009-027 — Technical Note
Date of publication
01 Jul 2009
Number of Pages
28
DSTKIM No
CA032822
CANDIS No
532019
Format(s):
Electronic Document(PDF)

Permanent link

Document 1 of 1

Date modified: