Skip to content

Multi-depot routing

With several depots, every routing decision hides a second question: which depot should serve this customer today? Multi-depot optimisation answers both at once.

  • Free 30-minute call
  • No commitment
  • You own the code
Typical industries
Logistics and transport, Trucking and fleet
Problem type
Routing
You receive
A documented model, run on your data

In short: A multi-depot routing optimisation plans deliveries from several depots at once. It decides which depot serves each customer and how each vehicle’s route runs. It decides both in one step.

The problem

You run three depots. Every evening, each one plans its own routes for its own customers. One sends a van forty minutes out to a customer only ten minutes from the next depot. Another is short of dock space while its neighbour has room to spare. Each plan looks fine on its own, and across all three depots you still pay too much.

The question a single-depot tool never asks

Run from one depot, and routing asks one question: in what order do you visit the stops? Run from several, and every stop adds a second one: which depot should serve this customer today? The two depend on each other. You’d need the depot before you can plan the route, yet the right depot depends on what the route will cost.

Why “nearest depot first” fails

The usual shortcut assigns every customer to the nearest depot, then routes each depot separately. It’s almost always wrong. Nearest-depot assignment ignores capacity, so depots in dense areas overflow while the others are half empty. It ignores depot costs too, so expensive sites keep sending vans. The rule also fixes the depot before the routes are planned. So it can never pick a depot that is slightly farther away, even when that would make the route much shorter.

What changes

Today, each depot plans its own customers, and you phone the other depots when a site runs out of dock space. Our model plans all your depots at once. It decides which depot serves each customer and builds the routes in the same run. You check one plan for all sites instead of stitching several together.

What the shortcut misses: a worked example

Take a customer on the border between the areas of two depots. Depot A is twelve minutes away, depot B fifteen. The nearest-depot rule picks A. But A’s vans are full that day, so serving the customer means sending one more van. Meanwhile a van from B already passes three minutes from the door. A joint model sees both facts and hands the stop to B for a detour of about six minutes. The rule would have paid for a whole extra van.

Depot assignment optimisation: what you get

We build on vehicle routing optimisation and apply it to your depot network. The model knows your depots, how much each can handle, what each costs and your past orders. It decides the depot and the route together, so every route already says which depot it starts from. You judge the result on four numbers: total distance, vehicles needed, cost per stop and how full each depot is. We test it on your own orders and peak days first, so you see how the plan splits the work between depots before trucks queue for a free dock.

  • A model written around your own multi-depot routing rules.
  • Results measured in the numbers you already track.
  • It slots into how you already work, and you can check every answer it gives.

How it works

We write your depots, your customers, your fleet and your rules into one model. You get the routes that cost the least and keep every rule. You still have the last word: you check the result and send it out.

What the multi-depot vehicle routing problem is

In optimisation, planning routes for several depots is called the multi-depot vehicle routing problem (MDVRP). The plain vehicle routing problem asks which vehicle visits which stops, and in what order. The multi-depot version adds a choice of depot for every customer. Many planning tools can’t make that choice, because they were built for one depot and a list of stops.

Add a second depot, and the problem changes shape. Every assignment decision affects every route, and every route affects which assignment is best. An MDVRP algorithm keeps both questions open at the same time, so neither gets settled too early.

Your depots may be driveways

“Depot” sounds like a warehouse. In service fleets it’s often the driver’s home. Technicians who start and end their day at home turn a one-depot problem into a multi-depot one, with one depot per person. The limit that matters most is then usually the length of the working day. Textbook models often leave it out. Model each home as its own depot, and the plan can put each person’s first job close to where they start.

Depot assignment, load balancing and depot cost

The MDVRP has three decisions that a tool for one depot never has to match with each other. The first is depot assignment, which changes with each day’s orders, volumes and traffic. The second is load balancing between depots. A plan that overruns one site’s dock capacity fails in operation: trucks queue outside the depot for a free dock, and routes start late. The third is depot cost. Some depots have higher fixed costs or cost more for every pallet they handle. So the depot with the shortest route isn’t always the cheapest once you add the depot’s own costs.

Multi-depot routing optimisation, solved jointly

Joint optimisation weighs assignment, load balance, depot cost and route sequence against each other at the same time. Then it returns the combination that’s cheapest overall. That’s multi-depot routing optimisation in practice: no decision gets fixed before the others are known.

Common questions.

Something else? Ask us directly.

In practice, yes. Each home works like a small depot where one vehicle starts and ends its day. Often there’s no load limit. The rule that limits the plan is the length of the working day. Textbook versions tend to leave that rule out, so check that any tool you test keeps it. Once the rule is in the model, each person’s first job is close to their home.

You can, and most people do, but it gives away savings. Once a customer is fixed to a depot, the routing can’t use a van from the other depot that passes nearby. A multi-depot model decides depot and route in the same run. Keep fixed assignments only where you need them, for example when a product is only stocked at one site.

Then that becomes a rule in the model. Orders for those products must be served from that depot, or picked up there on the way. Everything else stays free to move between sites. That depot first gets the orders only it can serve. The model spreads the other orders across your other depots, so this one depot isn’t overloaded.

Sometimes it can, and if that’s the case, we’ll tell you. Standard software is built for an average operation, though. Yours runs on its own rules: your contracts, your exceptions, the things you know by heart. A custom model writes those rules in, and that’s where the better plan comes from.

You don’t need either to start. We build the model from the data you’ve already got, even if it lives in three spreadsheets and one person’s head. You get a system you run yourself. We train your team until they no longer need us.

You see a first result with the prototype, before you commit to anything bigger. We start with a free 30-minute call about your operation and the model that would fit it. Then we build a working prototype and run it on your numbers.

Tell us what you’re planning.

In a free 30-minute call with a specialist, you find out whether optimisation can help.

  • Free, no commitment
  • You talk to a specialist directly
  • A clear go or no-go