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
Cloud Computing Environment and Security Challenges: A Review
Cloud computing exhibits a remarkable potential to offer cost-effective and more flexible services on-demand to the customers over the network. It dynamically increases the capabilities of the organization without traini...
Clustering of Image Data Using K-Means and Fuzzy K-Means
Clustering is a major technique used for grouping of numerical and image data in data mining and image processing applications. Clustering makes the job of image retrieval easy by finding the images as similar as given i...
Internet of Everything (Ioe): Analysing the Individual Concerns Over Privacy Enhancing Technologies (Pets)
This paper aims to investigate the effectiveness of the provision of privacy of individuals through privacy enhancing technologies (PETs). The successful evolution and emergence of cyberspace with the real world through...
Good Quasi-Cyclic Codes from Circulant Matrices Concatenation using a Heuristic Method
In this paper we present a method to search q circulant matrices; the concatenation of these circulant matrices with circulant identity matrix generates quasi-cyclic codes with high various code rate q/(q+1) (q an intege...
Generating and Analyzing Chatbot Responses using Natural Language Processing
Customer support has become one of the most important communication tools used by companies to provide before and after-sale services to customers. This includes communicating through websites, phones, and social media p...