Głównym założeniem algorytmów VRP jest optymalizacja tras, a w związku z tym kosztów związanych z działalnością transportową. Algorytmy Emapy mogą jednak być skierowane na optymalizację innych celów lub zasobów. Przykładem niech będzie równomierne rozłożenie zleceń dla poszczególnych pojazdów (wykorzystanie całej floty lub tylko jej części). Założenia wprowadzane jako dane do algorytmów VRP to:
Każdy z parametrów może dodatkowo zawierać wyjątki lub dopuszczenie do przekroczenia zdefiniowanej reguły. Często ma to znaczenie dla takich parametrów jak definicja okien czasowych lub maksymalny koszt trasy.
The development of Emapa VRP (Vehicle Routing Problem) algorithms is a constant drive for perfection. Apart from acclaim granted by industry clients, the company is also proud of its success on the scientific level. During simulated environment tests Emapa team constituting of misters Sielski, Cybula and Rogalski (SCR) beat a number of world records in a comparative Gehring and Homberger test for 800 and 1000 pickup points – number of clients. The aim of the above mentioned test is to:
It is worth mentioning that such good results are exceptionally rare due to the high level of efficiency presented in the ranking. During the cited trial Emapa employees focussed mainly on 800 customer instances.
The whole venture is carried out by Emapa company as part of a research project (number POIR.01.01.01.-00-0222/16) called “New methods of optimising VRP issues”, which is part of the national Smart Growth 2014-2020 operational program (Activity 1.1 – R&D projects for companies) with a value of more than 4 million PLN.
Issues pertaining to fleet and transport cost reduction usually boil down to monitoring of fuel cost and car use policy. Companies introduce fuel limits and verify the driven distances via GPS enabled solutions. Some companies also try to profile their drivers’ driving styles forcing them to economise. When company cars cover many dozen kilometers daily, however, meaningful cost reductions can be achieved only by total optimisation of routes. This task is complicated due to many hindering factors:
The above mentioned problems can be solved by utilisation of VRP (Vehicle Routing Problem) algorithms. These algorithms generate substantial savings by solving most logistic problems. Optimisation of routes can yield the following benefits: