An Improved Differential Evolution Algorithm for TSP Problem

TSP (Traveling Salesman Problem) is a kind of typical NP problems, mostly settled by genetic algorithm (GA). Differential Evolution Algorithm (DE) is a kind of new Evolution Algorithm which has many similarities with GA. We proposed to solve TSP problem by improved differential evolution algorithm....

Full description

Saved in:
Bibliographic Details
Published in:2010 International Conference on Intelligent Computation Technology and Automation Vol. 1; pp. 544 - 547
Main Authors: Mei Mi, Xue Huifeng, Zhong Ming, Gu Yu
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2010
Subjects:
Ant colony optimization
Automation
Chromium
Cities and towns
differential ecolution algorithm
Educational institutions
genetic algorithm
Genetic algorithms
Genetic mutations
Random number generation
Scheduling algorithm
Traveling salesman problems
tsp problem
ISBN:9781424472796, 1424472792
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:TSP (Traveling Salesman Problem) is a kind of typical NP problems, mostly settled by genetic algorithm (GA). Differential Evolution Algorithm (DE) is a kind of new Evolution Algorithm which has many similarities with GA. We proposed to solve TSP problem by improved differential evolution algorithm. Added an auxiliary operator for regulating integer sequence to mutation process, and replaced the original crossover operator by Liuhai crossover operator. Experimental results show that this method can effectively improve the convergence speed and optimal quality, show good characteristic in the solution of TSP problem.
ISBN:9781424472796
1424472792
DOI:10.1109/ICICTA.2010.461