Project: review a Quartz field-service route

Last updated: 4 Oct 202618 min read

project

Plan a fictional morning route for Quartz Field Service technician T-8. Three jobs have verified service entrances and fixed appointment windows. A fourth address is ambiguous and must remain outside the final candidate until the dispatcher confirms its street number. The task is to prepare a reviewable route recommendation, not to send directions. The prompt must keep address identity, coordinate order, travel estimates, service durations, and dispatch authority separate.

Validate locations and route inputs

For J-47, choose the full street-address match at 47 Harbor Lane after comparing it with a partial match in another district. Reject an imported coordinate pair whose order is not declared. Use the verified service entrance instead of a building centroid. The current driving matrix supplies 22 minutes from depot to J-47, 18 to J-52, and 31 to J-71 for the planned departure. A week-old 16-minute estimate for the last leg is not a substitute. A missing current leg leaves the plan provisional.

Compute and review

T-8 leaves at 08:30, reaches J-47 at 08:52, waits until 09:00, and finishes 30 minutes of service at 09:30. The next leg reaches J-52 at 09:48; its 10:00 start and 25-minute service end at 10:25. The final leg reaches J-71 at 10:56; a start at 11:00 and 20-minute service end at 11:20. Those times satisfy the stated windows only if skills, capacity, access, and break rules also pass. The map preview reveals a closed loading dock at J-52, so the dispatcher corrects the entrance and refreshes affected legs before approval.

J-47: 08:52 arrival; 09:00–09:30 service.
J-52: 09:48 arrival; 10:00–10:25 service.
J-71: 10:56 arrival; 11:00–11:20 service.
Ambiguous fourth address: excluded.
J-52 closed dock: correct point, refresh legs, recompute.
Dispatch: pending current user review and effect receipt.

Performance and operating cost

Validation of one ordered S-stop route is O(S), while a full pairwise travel matrix can grow as O(S squared). Searching every stop ordering grows factorially, so larger fleets need bounded candidates or a dedicated solver followed by independent validation. Map review and permission checks add time but expose errors that arithmetic cannot. The final packet includes place identities, matrix version, computed times, map artifact, recipient, and any dispatch receipt.

Common Mistakes

Do not use the partial address match as a verified stop.
Do not guess coordinate order.
Do not replace a missing current leg with an old estimate.
Do not ignore waiting and service durations.
Do not send an unreconciled route after a timeout.

Connected lessons

prompt engineering

location dispatch