The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
LZW Encoding in Genetic Algorithm
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.
Related Content
Bhargav Naidu Matcha, Sivakumar Sivanesan, K. C. Ng, Se Yong Eh Noum, Aman Sharma.
© 2023.
60 pages.
|
Lavanya Sendhilvel, Kush Diwakar Desai, Simran Adake, Rachit Bisaria, Hemang Ghanshyambhai Vekariya.
© 2023.
15 pages.
|
Jayanthi Ganapathy, Purushothaman R., Ramya M., Joselyn Diana C..
© 2023.
14 pages.
|
Prince Rajak, Anjali Sagar Jangde, Govind P. Gupta.
© 2023.
14 pages.
|
Mustafa Eren Akpınar.
© 2023.
9 pages.
|
Sreekantha Desai Karanam, Krithin M., R. V. Kulkarni.
© 2023.
34 pages.
|
Omprakash Nayak, Tejaswini Pallapothala, Govind P. Gupta.
© 2023.
19 pages.
|
|
|