Skip to main content

No more than one hypermarket per trip

When to use

When you need to build more reliable routes despite the hardly predictable time transport spends waiting to be unloaded.

At hypermarkets, the unloading queue can take from 30 minutes to 4 hours. To make routes more reliable, you can build trips so that each trip includes no more than 1 hypermarket.

Diagram

image

How to implement

Use the order_features and order_restrictions compatibilities.

  • Order_features is a feature of the order.
  • Order_restrictions is a requirement for the order.

If you make these values unique for each hypermarket, the route is built so that such orders cannot end up in the same trip, because they are not compatible.

You can also solve this task with the capacity_x capacity limits: set 1 for every hypermarket order, and set the maximum allowed number of hypermarkets per trip for the transport.

Examples

Example 1

There are three orders, two of them to hypermarkets.

  • Hypermarket order #1 has order_restrictions = 1, order_features = 1
  • Hypermarket order #2 has order_restrictions = 2, order_features = 2
  • Order #3 has order_features = 1,2

As a result, the algorithm calculated the route as follows:

  • Orders #1 and #2 were delivered by different vehicles, because they are not compatible.
  • Order #3 was delivered together with hypermarket order #2, because that is optimal by distance.

Example 2

There are three orders, two of them to hypermarkets. There are two vehicles.

  • Hypermarket orders #1 and #2 have cargos.capacity_x = 1
  • Order #3 has cargos.capacity_x = 0
  • Both vehicles have transports.capacity_x = 1

As a result, the algorithm calculated the route as follows:

  • Hypermarket orders #1 and #2 were delivered by different vehicles, because they do not fit together by capacity.
  • Order #3 was delivered together with the second hypermarket order, because that is optimal by distance.