I have a dataset of fire stations within an area. I would like to divide that area up into segments whereby each fire station covers a segment. This should be based on driving time. e.g. if I have 2 fire stations, fire station 1 should attend to all incidents with X segment as it will always be closer than fire station 2.

In the example below, fire station 1 = red dot and 2 = yellow dot. This is fictional, however you will see that station 2 covers a greater area to the south due to the high speed road going west from Hagworthingham.

Fire station service areas by drive time

I have around 50 stations dotted on the map. I'd like to break up their areas accordingly. I can use OSRM or GraphHopper but in reality its the theory behind how I can calculate this that I am trying to understand.


This can be done with Dijkstra exploration of a graph, where you define multiple start locations and avoid overlapping. Regarding GraphHopper see this blog post

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.