The Method of Transport Logistics Problem Solving by the MAX-MIN ACO Algorithm

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

The article provides a detailed analysis of the well-known mathematical methods that are used in solving transport logistics problems of various types. Their advantages and disadvantages are determined. The article proposes to use the methods of swarm intelligence to find the optimal route, taking into account all forbidden zones. The problem of transport logistics was solved by the ant colony optimization algorithm on a control example. The results of work of the method were analyzed. The main disadvantages are established. It is proposed to use a modification of the ant colony algorithm - the Max-Min ant colony optimization algorithm. The effectiveness of the method for solving the problem of transport logistics by the algorithm of max-min optimization of an ant colony was tested on a control example. An experimental calculation of the optimal route of traffic from the starting point to the final point is given taking into account the forbidden zones.

Cite

CITATION STYLE

APA

Khudov, H., Koval, V., Khizhnyak, I., Bridnia, Y., Chepurnyi, V., Prykhodko, S., … Savran, V. (2022). The Method of Transport Logistics Problem Solving by the MAX-MIN ACO Algorithm. International Journal of Emerging Technology and Advanced Engineering, 12(7), 108–119. https://doi.org/10.46338/ijetae0722_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free