Abstract
The paper presents the Ant Colony Optimization (ACO) algorithms, and investigates their convergence properties. Our investigation is limited to the following ACO algorithms: Ant System, MAX-MIN Ant System, Elitist Strategy of Ant System and Rank Based Version of Ant System. In the literature can be seen, that a novel of optimization problems are solved with ACO algorithms. In our investigation, we limited the Multi-Depot Vehicle Routing Problem with Time Windows (MDVRPTW), which is an NP-hard discrete optimization problem. The paper presents a literature review in connection with ACO algorithms, and Vehicle Routing Problem (VRP). After that, the mathematical model is written. The paper also presents the implemented algorithms, and the test results based on benchmark data.
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.
