Abstract
We study the ant colony method developed to solve the traveling salesman problem. We consider the possibility to apply the ant colony method to other graph-based problems: to the problem of collecting resources under various constraints and conditions and to the routing problem for several vehicles with the possibility to choose the place where these vehicles are located. We develop an algorithm that implements this method. We give an estimate of the algorithm's efficiency for various problems. The algorithms has proven to converge quickly, and the resulting solution is close to the optimal. This method can be recommended for solving most graph-based problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
