How this works

Build an itinerary that can plausibly be followed, rather than a list of attractive places. Reconcile dates, visitor interests, accommodation location, opening windows, visit durations and movement time. Keep confirmed facts separate from assumptions so a planner can see which parts still need verification.

Start with a broad candidate pool, then group nearby places and test each day's sequence. Preserve fixed appointments and visitor constraints before optimizing convenience. The output is a reviewed planning draft with alternatives; it does not reserve tickets, arrange transport or promise availability.

Before you start

Prepare the inputs

visitor_brief

Required

structured dates and preference notes

Resolve date and timezone ambiguity; distinguish hard constraints from preferences.

fixed_commitments

Required

appointments and start/end locations

Include exact times and whether they may move; use an explicit empty list when none exist.

place_candidates

Required

place IDs, coordinates and source records

Preserve official names, current hours, visit-duration assumptions and evidence dates.

travel_parameters

Required

transport mode, buffers and budget rules

Record currency and whether estimates include entry, meals and transport.

Implementation, step by step

1. 01

   Translate the request into constraints

   • Create a table of hard requirements, preferences and unresolved questions. Anchor each day to accommodation, arrival or departure details and any fixed commitments.
   • Use only necessary accessibility or dietary information voluntarily supplied for planning. If a constraint is unknown, show an assumption rather than treating it as absent.

   Checkpoint: The planner can identify every mandatory condition before place selection.

2. 02

   Build and verify the candidate pool

   • Find suitable attractions, restaurants and activities with stable identifiers and official source records. Record opening dates, weekday patterns, exceptions and reservation requirements.
   • Reject nonexistent or permanently closed places. Mark uncertain seasonal hours, unavailable ticket information and estimated visit durations explicitly; missing information is not zero duration or free entry.

   Checkpoint: Each candidate has a traceable location and a current evidence status.

3. 03

   Group places into practical days

   • Cluster candidates by geography and visitor priorities. Reserve fixed commitments first, then assign nearby places with a mix of effort and interests.
   • Avoid cramming all high-ranked candidates into one day. Set aside alternates by area so weather, fatigue or a closure can be handled without rebuilding the entire plan.

   Checkpoint: Every day has a coherent area, realistic load and a nearby alternative.

4. 04

   Check the sequence and timing

   • Calculate travel time for the chosen mode, add approved buffers and schedule arrival, visit and departure times. Recalculate budget totals with deterministic arithmetic and explicit currency.
   • Test every stop against opening windows and the next commitment. If no routing service is available, use documented manual travel estimates and label the plan as needing route verification.

   Checkpoint: A constraint table exposes overlap, late arrival, budget excess and unverified travel assumptions.

5. 05

   Explain choices and prepare the handoff

   • Write a compact visitor-facing plan with why each stop fits, practical notes and what requires confirmation. Keep evidence and the detailed constraint table available to the planner.
   • Give alternatives with the specific substitution condition and resulting timing changes. Refresh volatile venue facts before final sharing; leave bookings and external messages to separately authorized work.

   Checkpoint: The handoff contains a feasible primary route, visible assumptions and usable fallbacks.

Decisions along the way

What you will produce

Check the result

• Recheck weekday and date-specific opening windows.
• Verify that travel legs connect the actual consecutive stops.
• Recompute daily time and cost totals outside the language model.
• Ensure every mandatory visitor constraint is satisfied or openly unresolved.

When something goes wrong

A worked example

SYNTHETIC EXAMPLE · NOT A REPORTED BUSINESS RESULT

Run a small pilot

Keep the scope clear

• No booking, payment or message sending is implied by preparing an itinerary.
• Do not promise real-time availability or safety from a planning snapshot.
• Retain only the visitor information needed for the requested plan.