VEHICLE ROUTING PLANNING IN KOPOS KOLÍN COMPANY

1 FÁBRY Jan
Co-authors:
1 SMOLÍK Tomáš
Institution:
1 Škoda Auto University, Mladá Boleslav, Czech Republic, EU, fabry@savs.cz, tomas.smolik@skoda-auto.cz
Conference:
CLC 2023 - Carpathian Logistics Congress, Wellness Hotel Step, Prague, Czech Republic, EU, November 8 - 10, 2023
Proceedings:
Proceedings CLC 2023 - Carpathian Logistics Congress
Pages:
71-77
ISBN:
978-80-88365-17-4
ISSN:
2694-9318
Published:
8th July 2024
Proceedings of the conference have been sent to Web of Science and Scopus for evaluation and potential indexing.
Metrics:
213 views / 99 downloads
Abstract

Route planning currently deals with an increase in demands that must be satisfied swiftly and at the lowest possible costs. This is also the case with KOPOS Kolín Company, which is one of the largest manufacturers of electrical installation materials. This company uses its own trucks to transport goods to various locations. Before the planning phase, it is necessary to take into account the available transport capacities and the wide portfolio of products offered, with different ranges of dimensions, shapes and weights. In general, transport tasks require a lot of processing time as well as the resources needed for calculation. Overall, this means that each plan is specific and must have a unique approach based on the requirements. Due to the computational complexity of vehicle routing problems, heuristic algorithms are necessary to be used to obtain a suitable solution to the problem. The aim of this paper is to use a heuristic algorithm based on the insertion method, and to develop an application in VBA for MS Excel which KOPOS company can use for daily route planning. The advantage of the application is the saving of company’s financial resources without the additional cost of special optimization software.

Keywords: Vehicle routing problem, heuristics algorithms, VBA for MS Excel, API key

© This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Scroll to Top