Emapa implements individual optimisation problems depending on the customer's needs and preferences.

The main assumption of VRP algorithms is to optimise routes and therefore costs related to transport activities. However, Emapa algorithms can be directed at optimising other objectives or resources. An example would be an even distribution of orders for individual vehicles (use of the entire fleet or only part of it). Assumptions entered as data for VRP algorithms are:

• list of points to visit,
• data on the number of vehicles (defined, limited, unlimited number),
• time window parameters (for each of the visited points),
• the pick-up delivery problem,
• load capacity
• compatibility of stop-base, stop-vehicle, stop-travel,
• maximum route cost.

Each of the parameters may additionally contain exceptions or admissions to exceed the defined rule. This is often relevant for parameters such as the definition of time windows or maximum route costs.

WATCH THE WEBINAR ‘ROUTE OPTIMISATION SAVES MONEY’