multiple-traveling-salesman

Here are 3 public repositories matching this 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-optimization multi-objective-optimization ant-colony-systems multiple-traveling-salesman pareto-front max-min-ant-system

Updated Nov 8, 2017
Java

ralucanecula / mTSP_ACO

Star

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…

ant-colony-optimization multi-objective-optimization ant-colony-systems multiple-traveling-salesman pareto-front

Updated Feb 2, 2017
Java

parsakhavarinejad / TSP_optimization

Star

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.

python optimization pyomo cplex tsp operations-research multiple-traveling-salesman integer-programming travelling-salesman-problem mtsp multi-tra

Updated Nov 26, 2023
Jupyter Notebook

Improve this page

Add a description, image, and links to the multiple-traveling-salesman topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the multiple-traveling-salesman topic, visit your repo's landing page and select "manage topics."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly