Pinned Repositories
DVRPTW_ACS
Ant colony system (ACS) based algorithm for the dynamic vehicle routing problem with time windows (DVRPTW). For more details, see this paper "Necula, R., Breaban, M., & Raschip, M.: Tackling Dynamic Vehicle Routing Problem with Time Windows by means of ant colony system. CEC, (2017)" (https://ieeexplore.ieee.org/document/7969606)
mTSP_ACO
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/document/7372224).
mTSP_Salesman_Selection_ACO
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
ralucanecula's Repositories
ralucanecula/DVRPTW_ACS
Ant colony system (ACS) based algorithm for the dynamic vehicle routing problem with time windows (DVRPTW). For more details, see this paper "Necula, R., Breaban, M., & Raschip, M.: Tackling Dynamic Vehicle Routing Problem with Time Windows by means of ant colony system. CEC, (2017)" (https://ieeexplore.ieee.org/document/7969606)
ralucanecula/mTSP_Salesman_Selection_ACO
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
ralucanecula/mTSP_ACO
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/document/7372224).