Input parameters:
- Maximum number of routes
Number n of cluster centers - Transportation relations for route train shipments (from supply chains)
- Source and sink for the stop point are already defined
- Path network with stop points, waypoints and restrictions is defined
Rough sketch of algorithm:
- Search all transportation relations with route train transport
- From this create a list of the assignment of the sources + stop point source and sink + stop point sink
- Define the number n of cluster centers in the layout
- Calculate the shortest distance of the source stop points to the cluster centers taking into account the restrictions with A*.
- Place the cluster center in the center of each cluster.
repeat clustering until clustering is optimized after 100 iterations
- Generate routes with all stop points of sources and sinks located within a cluster center
- Calculate shortest route to reach all sources and sinks
- Show routes and path length
Premise: Sources must lie locally in front of the sink