The optimal solution of TSP using the new mixture initialization and sequential transformation method in genetic algorithm

Authors:
Rae-Goo Kang;Chai-Yeoung Jung
Affiliations:
Dept. Computer Science & Statistic, Chosun University, Gwangju, Korea;Dept. Computer Science & Statistic, Chosun University, Gwangju, Korea
Venue:
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Year:
2006

Citing 4
Cited 0

Genetic Algorithms Plus Data Structures Equals Evolution Programs

Genetic Algorithms Plus Data Structures Equals Evolution Programs
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms for the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd International Conference on Genetic Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

TSP is a problem finding out the shortest distance out of possible courses where one starts a certain city and turns back to a starting city, visiting every city only once among N cities. This paper proposes the new method using both population initialization and sequential transformation method at the same time and then proves the improvement of capability by comparing them with existing methods.