Using Route Optimization to Reorder Calendar Events
This guide covers using route optimization to reorder calendar events.
On this page
Jump to any section using the links below
TABLE OF CONTENTS
- What is Route Optimization?
- Where to Access Route Optimization
- How Route Optimization Works
- Using Route Optimization: Step-by-Step
- Practical Examples
- Understanding the Algorithms
- Quick Setup
- Best Practices
- Troubleshooting
- Comparing Pack vs. Optimize Order
- Related Features
- Summary
What is Route Optimization?
- Field service technicians visiting multiple customer locations
- Healthcare professionals making home visits
- Sales representatives scheduling client meetings
- Any mobile resource traveling between appointment locations
Where to Access Route Optimization
How Route Optimization Works
The Optimization Process
- Extracts location data from each event (addresses or coordinates)
- Calculates distances between all locations using real routing data
- Evaluates thousands of combinations (e.g., "40,320 possible routes and 64 transits")
- Applies your selected algorithm (brute force, nearest neighbor, or genetic)
- Ranks routes based on your optimization goal (time, distance, or CO2)
- Presents the optimal sequence with before/after comparison
Using Route Optimization: Step-by-Step
Step 1: Select Multiple Events
- Hold Ctrl (Windows/Linux) or Cmd (Mac) and click each event
- Or click the first event, hold Shift, and click the last event
- Belong to the same resource
- Have location information (address or coordinates)
Step 2: Click Optimize Order
Step 3: Review Current Statistics
- Driving minutes: Total time spent driving
- Driving distance: Total kilometers traveled
- CO₂ emission: Estimated carbon footprint
Step 4: Configure Optimization Parameters
Parameter 1: Exclude Transport To/From Base
- Exclude transport to/from base - Minimize time from start of first event to end of last event (ignores travel from home/office)
- Include transport to/from base - Minimize time from beginning of driving to first event until return from last event
Parameter 2: Optimization Method
- Evaluates every possible combination
- Always finds the absolute best route
- Best for: High-priority schedules where perfect optimization matters
- Note: "Heavy" computational load
- Fast and simple algorithm
- Always goes to the nearest unvisited location
- Best for: Quick optimization when locations are relatively clustered
- Note: May not find the absolute best route but is very fast
- Evolutionary algorithm that "learns" better routes
- Balances speed and optimization quality
- Best for: Large numbers of events (10+) where brute force is too slow
- Note: Gets very close to optimal without checking every possibility
Parameter 3: Optimization Goal
- Minimize driving minutes - Reduces total travel time
- Minimize driving distance - Reduces total kilometers traveled
- Minimize birds flight - Optimizes based on straight-line distances (as-the-crow-flies)
Step 5: Review Optimized Results
- Driving minutes: New total travel time
- Driving distance: New total kilometers
- CO₂ emission: New carbon footprint
- Shows exactly how much time, distance, and CO₂ you save
- Example: "✅ 51 min." saved in driving time
- "Optimized in 1.5 seconds"
Step 6: Review New Event Schedule
- Date: When events occur
- Resources: Which resource is assigned
- Time of first event: When the day starts (editable)
- Buffer between events: Minutes between consecutive events
- Round off start times: Time interval rounding preference
- Location: Full address for each event
- Old time: Original scheduled time slot
- New time: Optimized time slot
- Type: Event type (e.g., "Konsulentbesøg")
- Checkbox: Select which events to apply optimization to
- Contact name: Associated person for the event
- Phone number: Contact information
- Events are listed in the new optimized sequence
- You can see exactly how each event's time changes
- Checkboxes allow excluding specific events from the reordering
- Blue links to contact names provide quick access
Step 7: Adjust Settings If Needed
- Enter 0 for back-to-back scheduling
- Enter 10-15 for short travel/preparation buffers
- The optimizer schedules events accordingly
- No - Use exact calculated times
- 5 minutes - Round to :00, :05, :10, etc.
- 10 minutes - Round to :00, :10, :20, etc.
- 15 minutes - Round to :00, :15, :30, :45
- 30 minutes - Round to :00, :30
Step 8: Select Events to Change
- Uncheck its checkbox
- The event will remain in its original time slot
Step 9: Apply the Optimization
Practical Examples
Example 1: Field Service Technician
- 226 minutes driving
- 245 km distance
- 31.8 kg CO₂
- 175 minutes driving (saves 51 minutes)
- 184 km distance (saves 60 km)
- 23.96 kg CO₂ (saves 7.8 kg)
- Method: Brute force (8 events)
- Goal: Minimize driving minutes
- Transport: Exclude transport to/from base
- Buffer: 0 minutes
- Rounding: No
Example 2: Healthcare Home Visits
- Select all 6 events
- Optimize with: Nearest neighbor method (fast)
- Set buffer: 15 minutes
- Set rounding: 15 minutes (professional appearance)
- Minimize: Driving minutes
Example 3: Sales Territory Visits
- Optimize with: Brute force method
- Goal: Minimize driving distance (not time)
- Include transport to/from base (starts/ends at office)
- Buffer: 0 minutes (meetings have built-in duration)
Understanding the Algorithms
When to Use Each Method
- Best for: 2-8 events
- Pros: Guaranteed optimal route
- Cons: Exponentially slower as events increase
- Use when: You need absolute best routing
- Best for: Any number of events
- Pros: Very fast, good results for clustered locations
- Cons: May miss better routes
- Use when: Quick optimization is needed, locations are nearby
- Best for: 9+ events
- Pros: Near-optimal results in reasonable time
- Cons: Not guaranteed perfect
- Use when: Large number of events makes brute force impractical
Quick Setup
- Select events (Ctrl/Cmd + Click)
- Click Optimize order
- Use defaults:
- Method: Brute force (if ≤8 events)
- Goal: Minimize driving minutes
- Transport: Exclude to/from base
- Review results
- Click Apply
Best Practices
Troubleshooting
Comparing Pack vs. Optimize Order
| Feature | Pack | Optimize Order |
|---|---|---|
| Purpose | Compress events to eliminate gaps | Reorder events for optimal routing |
| Event order | Maintains original sequence | Changes sequence for efficiency |
| Location data | Not required | Required for all events |
| Calculation | Simple time-based compression | Complex route optimization |
| Best for | Filling schedule gaps after cancellations | Field service, mobile workers |
| Processing time | Instant | 1-2 seconds |
Related Features
- Using the Pack feature to compress calendar events - Eliminate gaps between events
- Calendar Gap - Optimize your calendar by closing those gaps, by finding more suitable events in the future
- How does the calendar system work? - Understanding calendar fundamentals
- Calendar resources and teams - Managing resources and scheduling
- Event types and availability - Configuring event types and availability rules
Summary
? Common searches
booking setup • calendar setup • appointment scheduling • booking configuration
Was this article helpful?
That’s Great!
Thank you for your feedback
Sorry! We couldn't be helpful
Thank you for your feedback
Feedback sent
We appreciate your effort and will try to fix the article