All Projects → EvanOman → AntColonyOptimization-TSP

EvanOman / AntColonyOptimization-TSP

Licence: other
An Ant Colony Optimization algorithm for the Traveling Salesman Problem

Programming Languages

matlab
3953 projects

Projects that are alternatives of or similar to AntColonyOptimization-TSP

minisat-rust
Experimental minisat SAT solver reimplementation in Rust
Stars: ✭ 68 (+134.48%)
Mutual labels:  np-complete
python-tsp-simulated-annealing
Visualisation of Simulated Annealing algorithm to solve TSP
Stars: ✭ 41 (+41.38%)
Mutual labels:  traveling-salesman
tsp-essay
A fun study of some heuristics for the Travelling Salesman Problem.
Stars: ✭ 15 (-48.28%)
Mutual labels:  traveling-salesman
pigosat
Go (golang) bindings for Picosat, the satisfiability solver
Stars: ✭ 15 (-48.28%)
Mutual labels:  np-complete
optapy
OptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.
Stars: ✭ 167 (+475.86%)
Mutual labels:  np-complete
Optaplanner
AI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.
Stars: ✭ 2,454 (+8362.07%)
Mutual labels:  traveling-salesman
Valhalla
Open Source Routing Engine for OpenStreetMap
Stars: ✭ 1,794 (+6086.21%)
Mutual labels:  traveling-salesman
Algorithms
A collection of algorithms and data structures
Stars: ✭ 11,553 (+39737.93%)
Mutual labels:  traveling-salesman
Osrm Backend
Open Source Routing Machine - C++ backend
Stars: ✭ 4,716 (+16162.07%)
Mutual labels:  traveling-salesman
cplex-example
Solving a TSP with the CPLEX C++ API.
Stars: ✭ 40 (+37.93%)
Mutual labels:  traveling-salesman
TravelingSalesmanHeuristics.jl
Julia package for simple traveling salesman problem heuristics
Stars: ✭ 46 (+58.62%)
Mutual labels:  traveling-salesman
Multiple-Vehicle-Routing
Simple MVR simulation
Stars: ✭ 27 (-6.9%)
Mutual labels:  traveling-salesman
Stock-Market-Prediction-using-Neural-Networks-and-Genetic-Algorithm
Matlab Module for Stock Market Prediction using Simple NN
Stars: ✭ 59 (+103.45%)
Mutual labels:  meta-heuristic
opt4j
Modular Java framework for meta-heuristic optimization
Stars: ✭ 25 (-13.79%)
Mutual labels:  meta-heuristic

Ant Colony Optimization For the Travelling Salesman Problem

This repository contains a working Matlab implementation of the Ant Colony Optimization algorithm for the Travelling Salesman Problem. The Matlab scripts generate some number of cities in a cirular or random distribution, and then run some number of iterations to find the best path through those cities.

Circular City Distribution

Here are some figures showing the algorithm performance for a circular arrangement of cities (this is more of a sanity check, this arrangement should be easy to solve).

Circular City Initial

Circular City Solution

Circular City History

Random City Distribution

Here are some figures showing the algorithm performance for a random city distribution:

Random City Initial

Random City Solution

Random City History

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].