METHODS AND ALGORITHMS TO SOLVE THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND FURTHER CONDITIONS.

In this paper methods and algorithms are examined for solving one important problem of transport logistics, namely formation of roadmap. The proposed mathematical model is based on the well-known multi-depot heterogeneous vehicle routing problem with time windows algorithm. Modifications of the model provide additional conditions and restrictions. Algorithmic support of information transport system in an enterprise is connected with features of the vehicle routing problem. The suggested solution is based on modified Clarke and Wright Algorithm and Variable Neighborhood Search. The risk on the roads and the cost of toll roads are calculated, too. [ABSTRACT FROM AUTHOR]