
The Council of Logistics Management formulated the following definition of logistics in 1997: “Logistics is that part of the supply chain process that plans, implements, and controls the efficient, effective flow and storage of goods, services, and related information from the point of origin to the point of consumption in order to meet customer requirements”. This definition emphasizes the significant importance of planning for the efficient flow of goods in the supply chain.
Planning, due to the planning period, can be divided into: strategic, tactical, operational, and current. In many areas of logistics, various planning methods are used, with different methods being employed for developing strategic plans compared to operational or current plans.
Within the framework of operational planning, one of the many tasks of logisticians is planning transport routes, cargo sizes, and the utilization of transport means. The goal of transport planning is the highest possible level of utilization of the transport fleet’s potential, with the shortest possible distance and time for cargo transport, thereby achieving a reduction in unit transport costs. In corporate practice, many route planning methods are used with the possibility of computer support.
Enterprises currently operate in an environment where competition is extremely demanding, and logistics systems are becoming increasingly complex. This requires the use of modern IT tools and quantitative methods that support making optimal logistics decisions. On the other hand, the improvement in computing power and the availability of computers allows for the increasing use of mathematical optimization models, among other things, for planning transport processes.
Applications of operations research in delivery route planning
The subject matter of this publication falls within the scope of vehicle routing issues in the planning of goods delivery routes. These issues, due to the numerous conditions that must be considered, have many different variants, described more broadly, for example, in [4]. The most important of these are:
– the Travelling Salesman Problem;
– the classic Vehicle Routing Problem (VRP).
The Travelling Salesman Problem is the simplest variant of delivery routing planning for a single means of transport, without additional restrictions regarding its load capacity. It consists of determining an optimal closed delivery route connecting a designated delivery point (base) with n subsequent supply points (recipients) with known locations.
The full article is available below in PDF format.
Source: Logistyka Magazine








