Assume i have a list of newspaper subscribers and their geographical location (f.e. postal codes) and the distance between different locations.
The goal is cluster subscribers together in 'rounds'. The size/length of a round is constrained by time: there is only limited time available for delivery each morning. This limits maximum distance per round.
Is their an algorithm that allows me to cluster subscribers/addresses into 'rounds' in such a manner that I minimise the number of required paperboys/rounds?
