Розв'язання транспортної задачі з обмеженнями за часом за допомогою метаеврістичного алгоритму

Abstract

In the paper the routing vehicle problem is considered taking into account the service time, for which the discrete model was developed and the numerical scheme based on metaheuristic algorithm was implemented. The effectiveness of the proposed algorithm was checked on the high-dimensional test problems.