This repository contains source code for the four investigated Ant Colony Optimization (ACO) algorithms for the bi-objective Multiple Traveling Salesman Problem (multiple-TSP). For more details, see this paper "Necula, R., Breaban, M., Raschip, M.: Tackling the Bi-criteria Facet of Multiple Traveling Salesman Problem with Ant Colony Systems. ICTAI, (2015)". To have an overview of the performance of the investigated algorithms, the considered multiple-TSP instances were solved by exact methods using CPLEX optimization software. The obtained results are available online at this benchmark page: http://profs.info.uaic.ro/~mtsplib/MinMaxMTSP/. Version: 1.0 Contact: necula dot raluca at gmail dot com
-
Notifications
You must be signed in to change notification settings - Fork 4
This repository contains source code for the four investigated ACO algoritms for the bi-objective Multiple Traveling Salesman Problem. For more details, see this paper "Necula, R., Breaban, M., Raschip, M.: Tackling the Bi-criteria Facet of Multiple Traveling Salesman Problem with Ant Colony Systems. ICTAI, (2015)" (https://ieeexplore.ieee.org/d…
ralucanecula/mTSP_ACO
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This repository contains source code for the four investigated ACO algoritms for the bi-objective Multiple Traveling Salesman Problem. For more details, see this paper "Necula, R., Breaban, M., Raschip, M.: Tackling the Bi-criteria Facet of Multiple Traveling Salesman Problem with Ant Colony Systems. ICTAI, (2015)" (https://ieeexplore.ieee.org/d…
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published