Team scheduling by genetic search

We consider a photographic studio that must schedule multiple teams of photographers to a large number of elementary and secondary schools. The photographers' schedules are to be optimized so that time constraints are satisfied and each team is able to at least visit two schools daily. A multiple travelling salesman model is used where the total distance traveled and time consumed can be evaluated in a single cost function to achieve overall optimality. A genetic algorithm has been applied to solve the problem. The results show that this approach rapidly provides an effective means for solving the problem.