Loading…
A novel multi-objective evolutionary algorithm based on subpopulations for the bi-objective traveling salesman problem
This paper presents a new approach called MOEA/NSM (multi-objective evolutionary algorithm integrating NSGA-II, SPEA2 and MOEA/D features). This paper combines the main characteristics of the NSGA-II, SPEA2 and MOEA/D algorithms, and also including 2-opt local search technique to improve the objecti...
Saved in:
Published in: | Soft computing (Berlin, Germany) Germany), 2019-08, Vol.23 (15), p.6157-6168 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper presents a new approach called MOEA/NSM (multi-objective evolutionary algorithm integrating NSGA-II, SPEA2 and MOEA/D features). This paper combines the main characteristics of the NSGA-II, SPEA2 and MOEA/D algorithms, and also including 2-opt local search technique to improve the objective space search. The MOEA/NSM algorithm was compared to the other classical approaches using 9 datasets for the bi-objective traveling salesman problem. In addition, experiments were carried out applying the local search in the classical approaches, resulting in a considerable improvement in the results for these algorithms. From the Pareto frontiers resulting from the experiments, we applied the evaluation metrics by hypervolume, Epsilon (
ϵ
), EAF and Shapiro–Wilk statistical hypothesis test. The results showed a better performance of the MOEA/NSM when compared with NSGA-II, SPEA2 and MOEA/D. |
---|---|
ISSN: | 1432-7643 1433-7479 |
DOI: | 10.1007/s00500-018-3269-8 |