Zhongxiao Hao
Hebei University of Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

An Improved NSGA-II Algorithm for Multi-objective Traveling Salesman Problem Yabo Luo; Min Liu; Zhongxiao Hao; Dongbo Liu
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 6: June 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Multi-objective traveling salesman problem (MOTSP) is an extended instance of traveling salesman problem (TSP), which is a well-known NP hard problem. In this paper, an improved NSGA-II algorithm (denoted by INSGA-II-MOTSP) is proposed to solve the MOTSP. Specifically, a layer strategy according to need is proposed to avoid generating unnecessary non-dominated fronts. The arena’s principle is also adopted to construct non-dominated set, so as to reduce the count of dominance comparison. In addition, an order crossover like operator and an inversion mutation operator are adopted for MOTSP. The experiment results show that the proposed INSGA-II-MOTSP algorithm is able to find better spread of solutions compared to other three algorithms. DOI : http://dx.doi.org/10.11591/telkomnika.v12i6.5476