Optimization of the Formula-1 Race Calendar Using Genetic Algorithm
Gabriella Polyak, Miklos Poth · 2022
The aim of this work is to solve an optimization problem using the genetic method. This could be considered similar to the Traveling Salesman Problem (TSP), as the topic is route optimization. The study is based on the Formula 1 race calendar and the geographical location of the Grand Prix venues. The optimization was done in two ways, with an add-on of Microsoft Excel, Excel Solver, and a program written in MATLAB. Excel Solver is based on: examining the possible solutions taking into account the constraints, then selecting the one that fits the most. The program written in MATLAB uses methods used in the genetic algorithm, such as selection, mutation, crossover and insertion.In this work, the results obtained in the two programs are compared and summarized. The Traveling Salesman Problem has been used many times to solve problems, but for this specific problem it has not been used yet.