Solving the Free Clustered TSP Using a Memetic Algorithm

Abstract

The free clustered travelling salesman problem (FCTSP) is an extension of the classical travelling salesman problem where the set of vertices is partitioned into clusters, and the task is to find a minimum cost Hamiltonian tour such that the vertices in any cluster are visited contiguously. This paper proposes the use of a memetic algorithm (MA) that combines the global search ability of Genetic Algorithm with local search to refine solutions to the FCTSP. The effectiveness of the proposed algorithm is examined on a set of TSPLIB instances with up to 318 vertices and clusters varying between 2 and 50 clusters. Moreover, the performance of the MA is compared with a Genetic Algorithm and a GRASP with path relinking. The computational results confirm the effectiveness of the MA in terms of both solution quality and computational time.

Authors and Affiliations

Abdullah Alsheddy

Keywords

Related Articles

Design and Modeling of RF Power Amplifiers with Radial Basis Function Artificial Neural Networks

A radial basis function (RBF) artificial neural network model for a designed high efficiency radio frequency class-F power amplifier (PA) is presented in this paper. The presented amplifier is designed at 1.8 GHz operati...

Comparison between Traditional Approach and Object-Oriented Approach in Software Engineering Development

This paper discusses the comparison between Traditional approaches and Object-Oriented approach. Traditional approach has a lot of models that deal with different types of projects such as waterfall, spiral, iterative an...

A Hybrid Framework using RBF and SVM for Direct Marketing

One of the major developments in machine learning in the past decade is the ensemble method, which finds highly accurate classifier by combining many moderately accurate component classifiers. This paper addresses using...

Energy Efficient Cluster-Based Intrusion Detection System for Wireless Sensor Networks

Wireless sensor networks (WSNs) are network type where sensors are used to collect physical measurements. It has many application areas such as healthcare, weather monitoring and even military applications. Security in t...

Enhanced Version of Multi-algorithm Genetically Adaptive for Multiobjective optimization

Multi-objective EAs (MOEAs) are well established population-based techniques for solving various search and optimization problems. MOEAs employ different evolutionary operators to evolve populations of solutions for appr...

Download PDF file
  • EP ID EP260639
  • DOI 10.14569/IJACSA.2017.080852
  • Views 135
  • Downloads 0

How To Cite

Abdullah Alsheddy (2017). Solving the Free Clustered TSP Using a Memetic Algorithm. International Journal of Advanced Computer Science & Applications, 8(8), 404-408. https://europub.co.uk/articles/-A-260639