Picture of DNA strand

Pioneering chemical biology & medicinal chemistry through Open Access research...

Strathprints makes available scholarly Open Access content by researchers in the Department of Pure & Applied Chemistry, based within the Faculty of Science.

Research here spans a wide range of topics from analytical chemistry to materials science, and from biological chemistry to theoretical chemistry. The specific work in chemical biology and medicinal chemistry, as an example, encompasses pioneering techniques in synthesis, bioinformatics, nucleic acid chemistry, amino acid chemistry, heterocyclic chemistry, biophysical chemistry and NMR spectroscopy.

Explore the Open Access research of the Department of Pure & Applied Chemistry. Or explore all of Strathclyde's Open Access research...

A demonstration of the utility of fractional experimental design for finding optimal genetic algorithm parameter settings

Stewardson, D.J. and Whitfield, R.I. (2004) A demonstration of the utility of fractional experimental design for finding optimal genetic algorithm parameter settings. Journal of the Operational Research Society, 55 (2). pp. 132-138. ISSN 0160-5682

[img]
Preview
PDF
Ref24.pdf
Final Published Version
License: Unspecified

Download (187kB)| Preview

    Abstract

    This paper demonstrates that the use of sparse experimental design in the development of the structure for genetic algorithms, and hence other computer programs, is a particularly effective and efficient strategy. Despite widespread knowledge of the existence of these systematic experimental plans, they have seen limited application in the investigation of advanced computer programs. This paper attempts to address this missed opportunity and encourage others to take advantage of the power of these plans. Using data generated from a full factorial experimental design, involving 27 experimental runs that was used to assess the optimum operating settings of the parameters of a special genetic algorithm (GA), we show that similar results could have been obtained using as few as nine runs. The GA was used to find minimum cost schedules for a complex component assembly operation with many sub-processes.