Abstract: The vehicle routing problems (VRP) is a rich class of optimization problems with a long history. They are among the most studied problems in operations research. Currently, strong optimization algorithms have been designed for a wide variety of the VRP. These problems can often be reformulated by large-scale set partitioning or set covering models and solved by column generation exactly or heuristically. This way is one of the most promising for industrial applications. In this talk, we discuss the classical VRP models, their reductions to set covering, as well as the strengths and weaknesses of this approach. Industrial applications of VRP, including new periodic petrol station replenishment problem will also be considered.

Cite: Kochetov Y.
The Vehicle Routing Problems: Results and Perspective
16th International Conference on Network Analysis 13-15 May 2026