Faster shellsort sequences: A genetic algorithm application.
Richard P. Simpson, Shashidhar Yachavaram · Computers and Their Applications · 1999
The recent popularity of genetic algorithms (GA's) and their application to a wide variety of problems is a result of their ease of implementation and flexibility. Evolutionary techniques are often applied to optimization and related search problems where the fitness of a potential result is easily established. Problems of this type are generally very difficult and often NP-Hard, so the ability to find a reasonable solution to these problems within an acceptable time constraint is clearly desirable. One such problem that has been researched thoroughly is the search for Shellsort sequences. The attributes of this problem make it a prime target for the application of genetic algorithms. Noting this, the authors have designed a GA that efficiently searches for Shellsort sequences that are top performers. This research has resulted in the discovery of several new sequences that are statistically 3% more efficient, from the standpoint of comparison counting, than the best sequences known.