Integrating Tabu Search into the Survivor Strategy of Genetic Algorithm
碩士 === 國立中正大學 === 資訊工程所 === 95 === Genetic algorithm (GA) is very effective to solve optimization problems. However, GA suffers from the serious problem of premature convergence. Premature convergence will trap GA into local optima. To avoid this problem, some studies solve it by maintaining populat...
Main Authors: | Cheng-Feng Ko, 柯政鋒 |
---|---|
Other Authors: | Chuan-Kang Ting |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/09807277415209858676 |
Similar Items
-
Analysis of usage of genetic and tabu search algorithms in shop scheduling
by: Edgaras Šakurovas, et al.
Published: (2008-12-01) -
Tabu Search and genetic algorithm for production process scheduling problem
by: Anna Burduk, et al.
Published: (2019-06-01) -
On Scheduling Unequal Release Time for Single Machine by Simulated Annealing and Tabu Search Algorithm
by: Jiunn-Feng Chiou, et al. -
A Tabu Search Algorithm for The Dynamic Vehicle Routing Problem
by: Ching-Wen Ke, et al.
Published: (2002) -
Searching Optimal Trading Strategy based on Quantum-inspired Tabu Search Algorithm
by: Jian-Wei Lin, et al.
Published: (2015)