Article ID: | iaor20012866 |
Country: | United States |
Volume: | 26 |
Issue: | 6 |
Start Page Number: | 749 |
End Page Number: | 779 |
Publication Date: | Nov 1995 |
Journal: | Decision Sciences |
Authors: | Pakath R., Zaveri J.S. |
Keywords: | genetic algorithms |
We present a simple scheme for the automated, iterative specification of the genetic mutation, crossover, and reproduction (usage) probabilities during run time for a specific genetic algorithm-driven tool. The tool is intended for supporting static scheduling decisions in flexible manufacturing systems. Using a randomly generated (base) test problem instance, we first assess the method by using it to determine the appropriate levels for specific types of mutation and crossover operators. The level for the third operator, reproduction, may then be inferred. We next report on its ability to choose one or more appropriate crossovers from a set of many such operators. Finally, we compare the method's performance with that of approaches suggested in prior research for the base problem and a number of other test problems. Our experimental findings within the specific scheduling domain studied suggest that the simple method could potentially be a valuable addition to any genetic algorithm-based decision support tool. It is, therefore, worthy of additional investigations.