multiple-traveling-salesman

There are 0 repository under multiple-traveling-salesman topic.

• 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

  ant-colony-optimizationant-colony-systemsmax-min-ant-systemmultiple-traveling-salesmanmulti-objective-optimizationpareto-front
  Language:Java 12

• 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).

  ant-colony-systemsmulti-objective-optimizationmultiple-traveling-salesmanpareto-frontant-colony-optimization
  Language:Java 10

• parsakhavarinejad / TSP_optimization

  This repository contains a Python notebook implementing a class for solving multiple Traveling Salesman Problems (TSP) using Pyomo and the CPLEX solver. The class includes a solution for the simple TSP scenario when there is only one driver.

  cplexinteger-programmingmtspmulti-tramultiple-traveling-salesmanoperations-researchoptimizationpyomopythontravelling-salesman-problemtsp
  Language:Jupyter Notebook 1