Genetic Algorithm Guidance of a Constraint Programming Solver for the Multiple Traveling Salesman Problem
Statistics and Analytical Sciences
This project developed a metaheuristic approach to the Multiple Traveling Salesman Problem that pairs a custom genetic algorithm with a conventional combinatorial optimization solver. This combined approach was used to build an optimal route for two popular radio show hosts to visit each of the 37 Atlanta area Jersey Mike's Subs in one day. This supported a fundraising eort to send children with chronic and terminal illnesses to Disney World through an organization called Bert's Big Adventure. Atlanta-area Jersey Mike's locations donated 100% of proceeds earned on this Day of Giving to Bert's Big Adventure. With the suggested route developed through our approach, the radio hosts successfully visited all 37 Jersey Mike's in one day, a task Bert's Big Adventure staff members had not been able to complete in previous years.