How the plan is made
Who goes where, and by which door.
One score, then three steps: which crew takes which person, what order each crew works in, and how to get from the curb to the machine. Every diagram below runs the planner’s own formulas, so change the inputs and watch the plan move.
Technical version →The score
Weighted hours at risk
What steps 1 and 2 both minimize
weight × hours past the deadline + 0.1 × (weight ÷ hours left) × hours waited
The line is nearly flat until a person’s backup runs out, then climbs at their device’s weight. Drag the deadline or the arrival and the cost follows.
A person no route reaches is charged the full 6 hours, so leaving someone out is never free.
5.0weighted hours: 1 h 30 past the deadline, times 3
1
Pair crews with people
Assignment problem, solved exactly (Hungarian method)
Sending each call its nearest van looks sensible and fails here: the most urgent call takes the only van close to someone else. Switch the rule to see it.
The pairing looks at every van and every call at once and picks the set with the largest total value: the drop in the score from sending that van now, per crew-hour the job takes.
| Call | Backup left | Van | Arrives in |
|---|---|---|---|
| 1 · Ventilator | 36 min | A | 19 min |
| 2 · Oxygen | 30 min | C | 54 min24 min late |
| 3 · Feeding pump | 4 h 00 | B | 15 min |
1.98weighted hours at risk: the ventilator took the van the oxygen call needed
2
Build each crew a route
Adaptive large neighborhood search (ALNS)
Take about 15% of the stops out of the plan, put them back where they cost least, keep the result if it helps. Repeat. Press play, or step through one move at a time.
Stops come out three ways: at random, the ones paying the most where they sit, or a cluster of neighbors. The answer is never worse than where it started, and the same inputs always give the same routes. Only each van’s first stop is committed; the plan is made again at the next step.
The start: the pairing from step 1, then every other stop put where it costs least.
2.75weighted hours at risk, best so far. It started at 2.75.
3
Walk the last hundred feet
Shortest path (Dijkstra) over the 3D scan
A Matterport scan is a set of spots where the camera stood, and each spot lists the spots it can see. A chain of them is a way a person can actually walk. Click any spot to put the machine there.
With no pin, the machine is assumed to be in the farthest room scanned from more than one spot, which passes over the closet and the bathroom.
11.9 mover 7 spots. Nobody has pinned the machine, so it is assumed to be in the farthest real room.
The data
One trip, and the building data that shapes each leg
The three data layers of the CoStar track. Pick a leg of the trip to see what Hearth reads there and what it changes. The keys stay on the server; the browser only ever sees the result.
- CoStar. Property records: 3,339 in the kit, 1,758 in the Houston market.
- Matterport. 3D scans of the buildings CoStar lists: 1,732 of the Houston 1,758 have one. A scan shows a unit type or a lobby, never a resident's own rooms.
- Vexcel. Aerial imagery of the same properties, 2023 to 2026 captures over Houston.
1. The home
How long this person has: the deadline in the score.
- CoStarYear built and construction materialHow fast the home heats up once the power is out. Older and lighter buildings turn unsafe sooner.
- VexcelRoof material and tree coverA dark, unshaded roof shortens the hours a heat-sensitive patient has left.
- VexcelThe aerial tile, read by a vision modelRoof tone, where the roof material alone does not say.
On this site
Where each step runs
- Results: Hearth
- The simple rule: highest weight per hour left first, to the nearest free crew. It is the published baseline.
- Results: Hearth, pairing and route search
- Steps 1 and 2. 15 search rounds per half-hour step, to keep a county replay fast.
- Results: the full county run
- Steps 1 and 2 with vans that make 4 stops a round and return to their station. 200 search rounds per step.
- Live dispatch
- A model orders the queue, with a rule as its fallback. Step 1's solver then matches crews: a crew carrying what the device needs first, then the least driving.
- Inside a building
- Step 3, in the browser, on the scan the building's CoStar record links to.
Limits
What the plan does not know
- Travel time is straight-line distance times 1.4, at 40 km/h. There is no road network, closure or flood layer.
- No record says an elevator is running today. A resident or the building office has to say so; an elevator only seen in a scan does not count until someone confirms it.
- A scan covers a model unit and a few rooms. The route inside is the layout of that unit type.
- How fast a home heats up is a rule of thumb over age, walls, roof and shade, not a thermal model.
- The plan books nothing. A refuge or a staging lot is a place to call about, and a dispatcher approves every move.
- All patients are simulated. The diagrams on this page run the same formulas on made-up vans, calls and rooms.