A GENETIC ALGORITHM SPREADSHEET MODEL FOR OPTIMIZING A COMBINATORIAL PROBLEM
Mike C. Patterson, Bob Harmel · 2013
This paper demonstrates the solution of a combinatorial optimization problem. The general problem faced is that of determining an acceptable sequence in which to provide a service to specific entities. In this specific case, the service is painting houses (the entities) and the sequence is constrained by the need to avoid painting contiguous houses within a minimum time period. Neither specialized optimization software nor a general programming language is used to perform the optimization. Instead, the authors formulated an Excel spreadsheet solution utilizing Excel add-in tools (Premium Solver Platform, Evolver, and GeneHunter). Genetic algorithms, a more efficient technique than those frequently found in Excel optimization software, were used to reduce solution time. Model development time was minimal and execution time was not a significant constraint. It is likely that genetic algorithm tools will continue to be used in more and more applications.