Using Route Optimization to Reorder Calendar Events

Modified on Tue, 5 May at 7:17 PM

Using Route Optimization to Reorder Calendar Events

The Optimize order feature automatically resequences multiple calendar events for a resource to minimize driving time, distance, or CO₂ emissions — without changing event durations.

TL;DR

In calendar view: Select 2+ events on one resource → Optimize order in Actions sidebar. Configure: base address inclusion (include/exclude travel to/from base), algorithm (Brute Force for <10 stops, Genetic for 10–50, Nearest Neighbor for 50+), and goal (time / distance / CO₂). Review before/after comparison → deselect events to keep in place → Apply optimization. Durations unchanged, only start times shift. Combine with Pack afterward to also eliminate gaps.

Get started in 5 steps

1

Select events

In calendar view, select 2+ events for the same resource. All events must have location data (addresses). Use Ctrl/Cmd + click for individual events or Shift + click for a range.

2

Open Optimize order

Click Optimize order in the Actions sidebar. The dialog shows current route statistics: total driving time, distance, and CO₂ emissions.

3

Configure parameters

Exclude transport to/from base: include for resources that start and end at a home base; exclude if they don't return to base. Algorithm: Brute Force (exact, best for <10 stops), Genetic (balanced, best for 10–50), Nearest Neighbor (fast, best for 50+). Goal: minimize driving time, distance, or CO₂ emissions.

4

Review results

The dialog shows before/after metrics (time saved, km saved, % improvement) and the proposed event order with addresses and transit times between stops. Deselect specific events to keep them in their original time slot. Click Recalculate to try different parameters.

5

Apply

Click Apply optimization. The calendar updates immediately with new start times. Event durations are unchanged — only the sequence and timing shift. After applying, use Pack to also close any gaps between events.

Read more

Choosing the right algorithm

  • Brute Force (2–8 stops): Tests every possible combination — guarantees the absolute best route. Time increases exponentially with more stops.
  • Genetic Algorithm (9–50 stops): Simulates evolution over hundreds of generations — typically within 3–7% of optimal. Good balance of quality and speed.
  • Nearest Neighbor (50+ stops): Always goes to the nearest unvisited location — very fast but can be 15–25% from optimal. Only practical option for large sets.

Troubleshooting

  • Button grayed out: Select at least 2 events on the same resource, all with location data.
  • No improvement shown: Events may already be in optimal order, or address data may be incorrect.
  • Events overlap after optimization: The tool doesn't check for conflicts — manually adjust or deselect conflicting events before applying.
  • Taking too long: Switch from Brute Force to Genetic or Nearest Neighbor.

Common searches

optimize route • reorder events • minimize driving • route optimization • field service • CO2 • genetic algorithm

Was this article helpful?

That’s Great!

Thank you for your feedback

Sorry! We couldn't be helpful

Thank you for your feedback

Let us know how can we improve this article!

Select at least one of the reasons
CAPTCHA verification is required.

Feedback sent

We appreciate your effort and will try to fix the article