Answer the question
In order to leave comments, you need to log in
Ant algorithm with "load capacity"
Actually, the task of such a plan has become:
There is graph G, there are k-applications, there is a taxi with a maximum capacity of 2 people, people can be picked up and dropped off along the way. It is necessary to find a route of minimum length, satisfying all requests.
What is the ant algorithm in a common, simple implementation, I more or less seem to understand, but how to attach the "carrying capacity" here without a clue. It is necessary to implement it with the help of the ant algorithm, how to use it in this situation, I have no idea, because the value of the "load", or rather people, is constantly changing, and this is also worth considering.
Where can I read about such a mod? I didn’t find anything particularly sensible for my task, maybe someone can help with some sketches, ideas, articles. I will be grateful.
Answer the question
In order to leave comments, you need to log in
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question