By Topic

Adaptive epsilon non-dominated sorting multi-objective evolutionary optimization and its application in shortest path problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yu Cheng ; Grad. Sch. of Inf., Production & Syst., Waseda Univ., Kitakyushu, Japan ; Yongjie Jin ; Jinglu Hu

This paper presents an adaptive epsilon non-dominated sorting method for multi-objective evolutionary optimization which has the ability to preserve both the efficiency and diversity. In NSGA-II, a fast non-dominated sorting mechanism is applied to sort solutions in an efficient way. However, it may suffer from deterioration and diversity in population is not as great as expected. To solve this problem, the concept of epsilon-dominance is applied for updating solutions in non-dominate sorted layers according to adaptive epsilon value, and the novel update strategy could prevent deterioration and keep diversity well. A real-world city map with 410 nodes and 1334 arcs is used in experiment, and the result shows that the proposed algorithm (AENSGA) performs better than NSGA-II in multi-objective shortest path problem.

Published in:

ICCAS-SICE, 2009

Date of Conference:

18-21 Aug. 2009