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

Psychological and Physiological Profiles in Oncology Caregivers: a Multivariable Cross-Sectional Study

Scientific research has led to enhanced medical assistance, and hence higher disease control and a continuous lifespan dilation. However, research mainly focusses on the patient’s condition, and, in some cases, caregiver...

Temporal Association Rule Mining: With Application to US Stock Market

A modified framework, that applies temporal association rule mining to financial time series, is proposed in this paper. The top four components stocks (stock price time series, in USD) of Dow Jones Industrial Average (D...

Comparative Study of Governance Information Systems for Scientific Research

The research and innovation effort is a major asset in international economic competition. Research and technological development are key areas to achieve this, contributing to economic growth and job creation. In order...

Probabilistic Search and Pursuit Evasion on a Graph

This paper presents an approach to locate an adversarial, mobile evader in an indoor environment using motion planning of mobile pursuers. The approach presented in this paper uses motion planning of mobile robots to sea...

SIMARECH 3: A New Application for the Governance of Scientific Research

In the international context of research assessment, many countries appear to move critically towards a quantitative evaluation policy, which would eventually complement or replace the traditional peer review system. How...

Download PDF file
  • EP ID EP309161
  • DOI 10.14738/tmlai.54.3211
  • Views 92
  • 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://europub.co.uk./articles/-A-309161