COMPARISON OF CAPABILITIES OF RECENT OPEN-SOURCE TOOLS FOR SOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS

1 KARKULA Marek
Co-authors:
1 DUDA Jerzy 1 SKALNA Iwona
Institution:
1 AGH University of Science and Technology, Cracow, Poland, EU, mkarkula@zarz.agh.edu.pl, jduda@zarz.agh.edu.pl, iskalna@zarz.agh.edu.pl
Conference:
CLC 2019, Tatra Hotel, Zakopane, Poland, EU, December 2 - 4, 2019
Proceedings:
Proceedings CLC 2019
Pages:
72-77
ISBN:
978-80-87294-96-3
ISSN:
2694-9318
Published:
3rd June 2020
Proceedings of the conference have been sent to Web of Science and Scopus for evaluation and potential indexing.
Metrics:
8 views / 5 downloads
Abstract

Strong competition in the logistics industry requires increasingly better vehicle route planning (VRP). Not surprisingly, for several years we can observe increasing interest in developing optimization tools for solving real logistics problems. This is supported by the increase in computing power of personal computers and the fact that advanced optimization solvers are often developed as free or open source software. The question arises about the quality of solutions produced by such solvers and whether they can be useful for solving real life problems. In this paper, we compare the quality of solutions and the computational cost of the most popular libraries (OR-Tools, VROOM and jsprit) for solving the Capacitated Vehicle Route Planning with Time Windows (CVRPTW) problem, which is one of the most common problems in logistics environment. The comparison is performed on 56 benchmark problems described in the literature with known optimal solutions.

Keywords: Capacitated Vehicle Routing Problem with Time Windows, OR-Tools, VROOM, jsprit
Scroll to Top