Synchronization of Capacitated Vehicle Routing Problem among Periods 1

The routing problems are one of the most important problems in the field of logistic with great practical applicability. This article deals with synchronized distribution during time periods. It is based on optimization using classical capacitated vehicle routing problem while providing different customers' demands among time periods. The goal is, except the minimization of the total distance, to achieve the stability of solution among the time periods, which contributes to simplification of transportation planning. Although using of the presented model can lead to a partial increase of distribution cost, on the other hand it ensures more transparent routes and eliminates the need for daily optimization. Therefore it brings a positive effect for distributors, drivers and customers that may result in greater economic benefits than the benefit from the optimization on a daily basis.