A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case

CNU IR > College of Smart Living > Dept. of Multimedia and Game Development > Periodical Articles > Item 310902800/28484

Please use this identifier to cite or link to this item: https://ir.cnu.edu.tw/handle/310902800/28484

Title:	A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case
Authors:	Tsai, Chun-Wei Tseng, Shih-Pang Chiang, Ming-Chao Yang, Chu-Sing Hong, Tzung-Pei
Contributors:	資訊多媒體應用系
Keywords:	COMBINATORIAL OPTIMIZATION EVOLUTION MODEL
Date:	2014
Issue Date:	2015-05-06 21:17:58 (UTC+8)
Publisher:	Hindawi Publishing Corporation
Abstract:	This paper presents a simple but efficient algorithm for reducing the computation time of genetic algorithm (GA) and its variants. The proposed algorithm is motivated by the observation that genes common to all the individuals of a GA have a high probability of surviving the evolution and ending up being part of the final solution; as such, they can be saved away to eliminate the redundant computations at the later generations of a GA. To evaluate the performance of the proposed algorithm, we use it not only to solve the traveling salesman problem but also to provide an extensive analysis on the impact it may have on the quality of the end result. Our experimental results indicate that the proposed algorithm can significantly reduce the computation time of GA and GA-based algorithms while limiting the degradation of the quality of the end result to a very small percentage compared to traditional GA.
Relation:	Scientific World Journal, 178621
Appears in Collections:	[Dept. of Multimedia and Game Development] Periodical Articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	1747	View/Open