Comparative Analysis of Evolutionary Algorithms for Multi-Objective Travelling Salesman Problem
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2018, Vol 9, Issue 2
Abstract
The Evolutionary Computation has grown much in last few years. Inspired by biological evolution, this field is used to solve NP-hard optimization problems to come up with best solution. TSP is most popular and complex problem used to evaluate different algorithms. In this paper, we have conducted a comparative analysis between NSGA-II, NSGA-III, SPEA-2, MOEA/D and VEGA to find out which algorithm best suited for MOTSP problems. The results reveal that the MOEA/D performed better than other three algorithms in terms of more hypervolume, lower value of generational distance (GD), inverse generational distance (IGD) and adaptive epsilon. On the other hand, MOEA-D took more time than rest of the algorithms.
Authors and Affiliations
Nosheen Qamar, Nadeem Akhtar, Irfan Younas
Keywords
Related Articles
- EP ID EP277043
- DOI 10.14569/IJACSA.2018.090251
- Views 110
- Downloads 0
Vicarious Calibration Based Cross Calibration of Solar Reflective Channels of Radiometers Onboard Remote Sensing Satellite and Evaluation of Cross Calibration Accuracy through Band-to-Band Data Comparisons
Accuracy evaluation of cross calibration through band-to-band data comparison for visible and near infrared radiometers which onboard earth observation satellites is conducted. The conventional cross calibration for visi...
XML Schema-Based Minification for Communication of Security Information and Event Management (SIEM) Systems in Cloud Environments
XML-based communication governs most of today’s systems communication, due to its capability of representing complex structural and hierarchical data. However, XML document structure is considered a huge and bulky data t...
Heterogeneous HW/SW FPGA-Based Embedded System for Database Sequencing Applications
Database sequencing applications including sequence comparison, searching, and analysis are considered among the most computation power and time consumers. Heuristic algorithms suffer from sensitivity while traditional s...
Data Flow Sequences: A Revision of Data Flow Diagrams for Modelling Applications using XML
Data Flow Diagrams were developed in the 1970’s as a method of modelling data flow when developing information systems. While DFDs are still being used, the modern web-based which is client-server based means that DFDs a...
Time-Dependence in Multi-Agent MDP Applied to Gate Assignment Problem
Many disturbances can impact gate assignments in daily operations of an airport. Gate Assignment Problem (GAP) is the main task of an airport to ensure smooth flight-to-Gate assignment managing all disturbances. Or, flig...