| Abstract [eng] |
Nowadays, the problem of optimal route creation is still not fully resolved in an increasingly important transport field, and there is a need to improve existing route optimization algorithms. Therefore, this paper seeks to overview the main algorithms of route optimization, analyze them, test and compare them with each other. On the basis of the analysis, the programming code of all algorithmswaswrittenandperformedasanexperimentalstudywiththeexperimentaldata. Asthe workdealswiththreeproblemsthatexistedfromoldtimesasunsolvabletasks,theanalysisoftheoretical tasks aimed at general perception of the problem was firstly performed. The results of the algorithmresearchandtheresultsobtainedrevealedthatthealgorithmof”simulatedannealing”is the most optimal. In this study, algorithms were designed for full graph. Also, according to time, the best algorithm is "Nearest neighbor", but it is the worst quality. "Genetic Algorithm", which is adaptedtoaddressthe(CVRP)capacitytransportrouteproblem,waschosenforprogramdevelopment. It is adapted to take into account the amount of points in the transport container to allow it to make a route. This hybrid algorithm forms a route according by two criteria. First by distance, and second by point for unloading capacity of point transport. This solution is adapted to the subgraph, namely for the transport logistics map. This program requires point coordinates based on the latitude and longitude of the Google map. It is necessary to provide data on the departure, the loading point of the transport and to indicate the available capacity of the transport. Require data requests for the landing capacity of the landing point. The program displays the drawn routes and makes a reference to the map. |
