Automatically designing diverse golf course routings
W.R. Morssink (TU Delft - Electrical Engineering, Mathematics and Computer Science)
N. Yorke-Smith – Mentor (TU Delft - Electrical Engineering, Mathematics and Computer Science)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Designing golf course routings is a challenging problem as a golf course should obey the golf course regulation, be safe to play by having enough room between the holes and be diverse and challenging to the golf players. A potential exact solution can come in the form of a constraint programming model, in which solvers take care of the generation of the golf course routing. However, there are some issues when working with a constraint programming model as exponential calculation and scalability are tough to deal with. A random search algorithm can deal better with the golf course routing problem. By dividing the problem into two smaller sub-problems. The first step consists of generating holes 1 to 9, while the second part takes care of the remaining holes. A genetic approach can also work by mutating parts of the initial population and using crossover to swap holes around. These three approaches are tested and compared against one another.