Service area: Delivery/production • Maximize profit as proc. minus costs • Distance as approx. for prod. volume
Service area: Customer demand • Customer bear „transport“ costs • Demand decreases with distance • D = Inc – tc * dist
Graphs
• Node-Edge-Networks – Used for infrastructural data of many kinds – Consist of Nodes & Edges – Weighted/unweighted – Directed/undirected
Location-Allocation problems
• E.g. p-Median problem – Build „p“ shops, hospitals etc. and try to find the best locations minimizing the average distance to consumers • Minimize amount of amenities • Maximize a market share • Etc.
Step 1 Choosing network data
• Free or Commercial supplier, e.g. OSM • Purpose • Quality checked?
Step 2 Creating the network topology
Step 3 Evaluating the graph • Using Djikstra‘s Algorithm
Constructing the service area
• Convex hull – Using a „Divide-and-Conquer“ algorithm – Definition • No pair of points exists, whose connecting line runs outside the final polygon • All points are covered • Perimeter length is minimal