AITeky Learn
Mini-project Logistics & Supply Chain Case Studio

Delivery van route optimiser

Inspired by publicly reported work at UPS

Find short delivery routes for a few vans with capacity limits, and compare them with a simple plan.

The brief

UPS has written about ORION, its system that works out the order of stops for its drivers, and how it saves miles and fuel. Solve the classic version of that problem: route a few vans with capacity limits through a set of stops, compare a nearest-neighbour plan with an optimised one, and show the distance saved on a map. Good looks like: correct solutions on benchmark instances with the gap to the best-known result, a map of routes, and a fuel and time estimate.

Read the case first

What UPS has said in public about this kind of work, on its own pages:

Make it your own

Route deliveries in your own town: a milk round, a pharmacy's home deliveries or a courier branch, with real road distances from OpenStreetMap and stops you mark yourself.

AITeky has no link with UPS, which has not reviewed or endorsed this brief. The brief only draws on what the company has published, uses open data rather than its data, and is a learning exercise: don't present your project as UPS's work or system.

What you will build

  1. Load benchmark routing instances
  2. Build a nearest-neighbour baseline
  3. Solve with OR-Tools or a local-search heuristic
  4. Compare distance with the best-known solutions
  5. Map the routes and estimate fuel saved

Free, open data to build it with

Sign up free to get the data and links

It takes a minute with your email. AiTeky Pass (₹999/month or ₹9,999/year) is free for your first 30 days.

We use essential cookies to run the site. With your permission we also set one anonymous ID to count unique visitors, and analytics cookies to see which pages help learners. Cookie notice

Join AiTeky Learn. It's free.

Create a free account to track your progress, save items for later and get study suggestions.

Sign up free Log in