Welcome to the InfoSci Platform
Reference Hub2
LZW Encoding in Genetic Algorithm

LZW Encoding in Genetic Algorithm

Worasait Suwannik
Copyright: © 2011 |Volume: 2 |Issue: 4 |Pages: 12
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781613505564|DOI: 10.4018/jaec.2011100102
Cite Article Cite Article

MLA

Suwannik, Worasait. "LZW Encoding in Genetic Algorithm." IJAEC vol.2, no.4 2011: pp.25-36. http://doi.org/10.4018/jaec.2011100102

APA

Suwannik, W. (2011). LZW Encoding in Genetic Algorithm. International Journal of Applied Evolutionary Computation (IJAEC), 2(4), 25-36. http://doi.org/10.4018/jaec.2011100102

Chicago

Suwannik, Worasait. "LZW Encoding in Genetic Algorithm," International Journal of Applied Evolutionary Computation (IJAEC) 2, no.4: 25-36. http://doi.org/10.4018/jaec.2011100102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

To solve a problem using Genetic Algorithms (GAs), a solution must be encoded into a binary string. The length of the binary string represents the size of the problem. As the length of the binary string increases, the size of the search space also increases at an exponential rate. To reduce the search space, one approach is to use a compressed encoding chromosome. This paper presents a genetic algorithm, called LZWGA, that uses compressed chromosomes. An LZWGA chromosome must be decompressed using an LZW decompression algorithm before its fitness can be evaluated. By using compressed encoding, the search space is reduced dramatically. For one-million-bit problem, the search space of the original problem is 21000000 or about 9.90x10301029 points. When using a compressed encoding, the search space was reduced to 8.37x10166717 points. LZWGA can solve one-million-bit OneMax, RoyalRoad, and Trap functions.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.