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

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

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

Full description

Saved in:
Bibliographic Details
Main Authors: Chun-Wei Tsai, Shih-Pang Tseng, Ming-Chao Chiang, Chu-Sing Yang, Tzung-Pei Hong
Format: Article
Language:English
Published: Wiley 2014-01-01
Series:The Scientific World Journal
Online Access:http://dx.doi.org/10.1155/2014/178621
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items