A set of ant colony system and max-min ant system based algorithms for the single-objective MinMax Multiple Traveling Salesman Problem (mTSP) and for the bi-objective mTSP
-
Updated
Nov 8, 2017 - Java
A set of ant colony system and max-min ant system based algorithms for the single-objective MinMax Multiple Traveling Salesman Problem (mTSP) and for the bi-objective mTSP
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…
Add a description, image, and links to the multiple-traveling-salesman topic page so that developers can more easily learn about it.
To associate your repository with the multiple-traveling-salesman topic, visit your repo's landing page and select "manage topics."