Подсистема решения задачи многоальтернативной маршрутизации грузоперевозок с помощью эволюционных методов

Formulation of the multialternative routing problem is made. To solve the problem have developed memetic algorithm for finding the global transportation plan, which includes ant colony algorithm as a local search algorithm, and the A* algorithm to solve the problem of finding the optimal path between the vertices of a graph with an irregular road average speed for the day. Developed and implemented a modular structure of routing subsystem