DECOMPOSITION OF THE TOUR USING MATHEMATICAL PROGRAMMING

Abstract

To solve tasks focused on the vertex service of the transport network, it is necessary to pay attention not only to the optimal sequence of vertices with respect to the selected optimization criterion (e.g. the total distance traveled), but also to other limitations that follow from the practical needs. The submitted contribution deals with introducing a decomposition method using mathematical programming based on the Route-First Cluster-Second approach. Firstly, the optimal route of the service vehicle is determined and then it can be decomposed into partial tours taking into account the capacity of the service vehicle. Mathematical models that can be used to implement this approach are presented in the text. The whole decomposition procedure is illustrated by specific examples, too.