Contribution of simple heuristics for the vehicle routing problem - A case study of a small brewery

Abstract

This paper presents a case study of a local brewery situated near to Prague. Even though its management already has the software which solves the vehicle routing problem by Mayer and Branch and Bound methods, it is still favourable to implement more approximation methods. The basic reason is that the Branch and Bound algorithm is complicated and software overflows may occur during its run in case of more cities in the cycle. The aim of this paper is to solve the real transportations using other methods that satisfy basic requirements of practicability. Transportation, which the brewery carried out during the selected week, provided data which were then analyzed using both the modifications of “classical” approximation methods (such as by Clark and Wright, Habr, and Mayer). Three types of the combination of these methods were also applied. The computed results were compared with the routes actually used by the brewery and with results from already implemented software. They showed that the brewery can save approximately 50,000 CZK (2,000 EUR) per year. Furthermore, the application of these methods needs neither any special technical equipment nor much time for the computation.

Cargo Securing - Comparison of Different Quality Roads

“…T-815,includingcontainercarriers),typesoftransportroutes(roadclasses)orforothermodes of transport. The influence of shocks on cargo securing method or road safety as such would be appropriate to take into account also for transport optimization tasks and models, whether inmilitaryconditions (Stodola,2018)orinotherareassuchasagriculturalproduction (Kučera andKrejčí, 2013 or Košíček et al, 2012). The aim of every transport is above all to transport cargo -thatis,safelyandnowadaysitisbecomingincreasinglyimportantatwhatcost.Damage to cargo, other technical equipment, infrastructure, environment or even injury or death of persons is a key issue which is best dealt with by prevention.…”

Modelling Distribution Routes in City Logistics by Applying Operations Research Methods

“…The Mayer algorithm, described as a heuristic approach in [38], is intended to address the multi-circuit transport problems with capacity limitations and a complete network of delivery paths. It is used to compile circuit routes with a selection of minimal elements, which can be used for assigning pick-up and delivery plans [39]. Addressing distribution tasks using this method is conducted in two consecutive stages.…”