| Abstract | Building a computer from common off-the-shelf components is a perplexing task. There are supply chain issues, compatibility issues, and budgetary constraints. This research investigates the use of an evolutionary algorithm to find the best possible components for a computer system within a designated budget. The algorithm starts with a set of parent combinations of builds and then creates a set of offspring. From the offspring set, they are mutated periodically and only the most compatible builds are kept for the next generation. This technique generates the best possible combination of components within the budget constraint in a finite number of generations. The application uses data from current component manufacturers, and a web interface has been created for ease of use. |
