GENETIC ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM USING NEIGHBOR-BASED CONSTRUCTIVE CROSSOVER OPERATOR
Journal: International Journal of Engineering Sciences & Research Technology (IJESRT) (Vol.7, No. 4)Publication Date: 2018-04-30
Authors : Akshay Vyas Dashmeet Kaur Chawla;
Page : 101-110
Keywords : Traveling Salesman Problem; NP-complete; Genetic Algorithm; Sequential Constructive Crossover; Neighbor-based Constructive Crossover.;
Abstract
In this paper, a new crossover operator named Neighbor-based Constructive Crossover (NCX) is evolved for a genetic algorithm that generates high quality solutions to the Traveling Salesman Problem (TSP). The proposed crossover operator uses the better edges present in parents' structure by comparing the neighboring nodes of a node in order to generate off-springs. The efficacy of the proposed crossover operator, NCX is set against two other crossover operators, single point crossover (SPCX) [19] and sequential constructive crossover (SCX) [1] for several standard TSPLIB instances [2]. Empirical results and observations illustrate that the new crossover operator is better than the SPCX and SCX in terms of quality of solutions.
Other Latest Articles
- A REVIEW ON SIX SIGMA METHODOLOGY IN MANUFACTURING INDUSTRIES
- PUBLIC DATA AND PRIVATE INFORMATION- THE THREAT AND ATTACK BY CYBER WORLD
- EFFECT OF EGGSHELL PARTICLE SIZE IN THERMAL AND THERMOMECHANICAL PROPERTIES OF PP/EGGSHELL COMPOSITES
- BALANCING LOAD USING PARALLEL COMPUTING AND DISTRIBUTED COMPUTING
- GEO REINFORCED STONE COLUMN TECHNIQUE FOR SOFT CLAY SOIL IMPROVEMENT-A REVIEW
Last modified: 2018-04-10 21:04:26