Search Results for "traveling salesman algorithms"
Sort By:
Showing 26 open source projects for "traveling salesman algorithms"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
OR-Tools - Google Optimization Tools
Google's software suite for combinatorial optimization
Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others.... -
2
GraphHopper Routing Engine
Open source routing engine for OpenStreetMap
GraphHopper invests in an active open source community. Our flagships are the GraphHopper routing engine and jsprit, the toolkit for solving rich vehicle routing problems. We promote a fair & diverse mindset. jsprit is a Java based toolkit for solving rich traveling salesman problems (TSP) and vehicle routing problems (VRP). It is lightweight, flexible, easy-to-use, and based on a single all-purpose meta-heuristic. The GraphHopper routing engine is fast and memory-efficient, using Java. It runs... -
3
Open Source Routing Machine
Open Source Routing Machine - C++ backend
... solves the Traveling Salesman Problem using a greedy heuristic. Tile generates Mapbox Vector Tiles with internal routing metadata. To quickly try OSRM use our demo server which comes with both the backend and a frontend on top. The easiest and quickest way to setup your own routing engine is to use Docker images we provide. We base our Docker images (backend, frontend) on Debian and make sure they are as lightweight as possible. -
4
GeneticSharp
GeneticSharp is a fast, extensible, multi-platform and multithreading
GeneticSharp is a fast, extensible, multi-platform and multithreading C# Genetic Algorithm library that simplifies the development of applications using Genetic Algorithms (GAs). Can be used in any kind of .NET 6, .NET Standard and .NET Framework apps, like ASP .NET MVC, ASP .NET Core, Blazor, Web Forms, UWP, Windows Forms, GTK#, Xamarin, MAUI and Unity3D games. GeneticSharp and extensions (TSP, AutoConfig, Bitmap equality, Equality equation, Equation solver, Function builder, etc). A Blazor... -
Powering the best of the internet | FastlyEnsure your websites, applications and services can effortlessly handle the demands of your users with Fastly. Fastly’s portfolio is designed to be highly performant, personalized and secure while seamlessly scaling to support your growth.
-
5
AntTSP
Traveling Salesman Problem (TSP) Solver
Fast Ant Colony Optimization TSP Solver -
6
jsprit
Open source toolkit for solving rich vehicle routing problems
jsprit is a java based, open-source toolkit for solving rich Traveling Salesman Problems(TSP) and Vehicle Routing Problems(VRP). It is lightweight, flexible and easy-to-use, and based on a single all-purpose meta-heuristic. Setting up the problem, defining additional constraints, modifying the algorithms and visualizing the discovered solutions is as easy and handy as reading classical VRP instances to benchmark your algorithm. It is fit for change and extension due to its modular design... -
7
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as PDF... -
8
jalicanto
Traveling Salesman Problem "window time based" aproximate solver
Time based Traveling salesman problem solver. Using iterated local search algorithm, implements xkick perturbation Programmed in Java. A class to use the TSP Suite(Thomas Weise, Raymond Chiong, J ¨org L¨assig, Ke Tang, Shigeyoshi Tsutsui, Wenxiang Chen, Zbigniew Michalewicz, Xin Yao, Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem. 2014.),is implemented. -
9
libfgen
Library for optimization using a genetic algorithm or particle swarms
libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported. -
Picsart Enterprise Background Removal API for Stunning eCommerce VisualsWith our Remove Background API tool, you can access the transformative capabilities of automation , which will allow you to turn any photo asset into compelling product imagery. With elevated visuals quality on your digital platforms, you can captivate your audience, and therefore achieve higher engagement and sales.
-
10
-
11
traveling-salesman is a GPS -route-planning and -navigation -system based on libosm and the OpenStreetMap.
-
12
DeliveryBoy's is one game implements the traveling salesman problem (TSP) into Android platform, using the AndEngine's API.
-
13
-
14
Traveling salesman problem solution using 2-optimal and 3-optimal algorithms, and modification including neighbourhood matrix. Written in c/c++ using the Qt4 library.
-
15
-
16
Awakener aims to provide a Java library for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.
-
17
SwarmTSP is a library of swarm intelligence algorithms for the Traveling Salesman Problem. Currently, it implements Ant Colony Optimization and Consultant-Guided Search algorithms.
-
18
A solution of the Traveling Salesman Problem using the Simulated annealing.
-
19
Solution to the Travelling Salesman Problem using Genetic Algorithms and the GALib library. The application logic is written in C# and interface in WPF. Requires .Net 4.0 beta 2 or above.
-
20
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
-
21
A heuristic implementation for solving the Bottleneck Traveling Salesman Problem (BTSP) and related problems, such as the Maximum Scatter Traveling Salesman Problem (MSTSP).
-
22
Genetic Algorithm based software to resolve the Traveling Salesman Problem (Problema del Commesso Viaggiatore).
-
23
Solving the travelling salesman problem with genetic (evolutionary) algorithms. The distance calculations are based on geographical coordinates. The progress of the algorithm is visualized with a geo-map and some statistics.
-
24
Exploration in Evolutionary Computing, implementing the Traveling Salesman Problem, solving it by creating random solutions and apply random solutions to the survivors of an evaluation/elimination process.
-
25
