Comparative Analysis of Three Metaheuristics For Solving The Travelling Salesman Problem

Journal Title: Transactions on Machine Learning and Artificial Intelligence - Year 2017, Vol 5, Issue 4

Abstract

This research paper aims to do a comparative study of three recent optimization metaheuristic approaches that had been applied to solve the NPhard optimization problem called the travelling salesman problem. The three recent metaheuristics in study are cuckoo search algorithm, cat swarm optimization algorithm and batinspired algorithm. To compare the performances of these methods, the three metaheuristics are applied to solve some benchmark instances of TSPLIB. The obtained results are collected and the error percentage is calculated. The discussion, will present which method is more efficient to solve the real application based on the travelling salesman problem.

Authors and Affiliations

Safaa Bouzidi, Moahmmed Essaid Riffi, Abdelhamid Bouzidi

Keywords

Related Articles

Data Editing for Semi-Supervised Co-Forest by the Local Cut Edge Weight Statistic Graph (CEWS-Co-Forest)

In order to address the large amount of unlabeled training data problem, many semisupervised algorithms have been proposed. The training data in semisupervised learning may contain much noise due to the insufficient numb...

Hello Message Scheme Enhancement in MANET based on Neighbor Mobility

The key idea behind the routing protocols based in multi hope is to find the required path from the source node to the destination. Since those protocols does not consider the node mobility in their mechanism, we propose...

A Model Driven Architecture Approach to Generate Multidimensional Schemas of Data Warehouses

Over the past decade, the concept of data warehousing has been widely accepted. The main reason for building data warehouses is to improve the quality of information in order to achieve specific business objectives such...

Image Category Recognition using Bag of Visual Words Representation

Image category recognition is one of the challenging tasks due to difference in image background, illumination, scale, clutter, rotation, etc. Bag-of-Visual-Words (BoVW) model is considered as the standard approach for i...

Harmonic Rule for Measuring the Facial Similarities among Relatives

The harmonic rule is a strategy used to measure the harmonic distance between any pair of images. The images have been trained and tested on individual pair of facial images respectively. The facial images have been trai...

Download PDF file
  • EP ID EP309161
  • DOI 10.14738/tmlai.54.3211
  • Views 94
  • Downloads 0

How To Cite

Safaa Bouzidi, Moahmmed Essaid Riffi, Abdelhamid Bouzidi (2017). Comparative Analysis of Three Metaheuristics For Solving The Travelling Salesman Problem. Transactions on Machine Learning and Artificial Intelligence, 5(4), 395-402. https://www.europub.co.uk/articles/-A-309161