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....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2010 International Conference on Intelligent Computation Technology and Automation Ročník 1; s. 544 - 547
Hlavní autoři: Mei Mi, Xue Huifeng, Zhong Ming, Gu Yu
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2010
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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