A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 10
Abstract
Genetic Algorithms (GAs) is a type of local search that mimics biological evolution by taking a population of string, which encodes possible solutions and combines them based on fitness values to produce individuals that are fitter than others. One of the most important operators in Genetic Algorithm is the selection operator. A new selection operator has been proposed in this paper, which is called Clustering Selection Method (CSM). The proposed method was implemented and tested on the traveling salesman problem. The proposed CSM was tested and compared with other selection methods, such as random selection, roulette wheel selection and tournament selection methods. The results showed that the CSM has the best results since it reached the optimal path with only 8840 iterations and with minimum distance which was 79.7234 when the system has been applied for solving Traveling Salesman Problem (TSP) of 100 cities.
Authors and Affiliations
Wael Alkhayri, Suhail Owais, Mohammad Shkoukani
An Algorithm Research for Supply Chain Management Optimization Model
In this paper, we consider the extended linear complementarity problem on supply chain management optimization model. We first give a global error bound for the extended linear complementarity problem, and then propose a...
Smart Transportation Application using Global Positioning System
Significant increase is noticed in the utilization of mobile applications for different purposes in the past decade. These applications can improve any individual’s way of life in many aspects such as communication, coll...
Towards a Modular Recommender System for Research Papers written in Albanian
In the recent years there has been an increase in scientific papers publications in Albania and its neighboring countries that have large communities of Albanian speaking researchers. Many of these papers are written in...
A Novel Architecture for Information Security using Division and Pixel Matching Techniques
The computer users have to safeguard the information which they are handling. An information hiding algorithm has to make sure that such information is undecipherable since it may have some sensitive information. This pa...
Multilayer Neural Networks and Nearest Neighbor Classifier Performances for Image Annotation
The explosive growth of image data leads to the research and development of image content searching and indexing systems. Image annotation systems aim at annotating automatically animage with some controlled keywords tha...