Search Results for "tsp"
Sort By:
Showing 34 open source projects for "tsp"
View related business solutions-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
GraphHopper Routing Engine
Open source routing engine for OpenStreetMap
...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 server side, offline on Android and iOS. It uses OpenStreetMap data, but can import other data sources as well. GraphHopper is a fast and memory-efficient routing engine released under Apache License 2.0. ... -
2
NVIDIA cuOpt
GPU accelerated decision optimization
NVIDIA cuOpt is a GPU-accelerated optimization engine designed to solve complex mathematical optimization problems at large scale. It supports a range of optimization models including linear programming (LP), mixed integer linear programming (MILP), quadratic programming (QP), and vehicle routing problems (VRP). Built primarily in C++, cuOpt leverages NVIDIA GPUs to deliver near real-time solutions for optimization tasks involving millions of variables and constraints. The platform provides... -
3
AntTSP
Traveling Salesman Problem (TSP) Solver
Fast Ant Colony Optimization TSP Solver -
4
A tool to support individuals and teams using high-maturity, metrics-intensive project management methodologies [such as PSP(SM) and TSP(SM)]. Supports personal and team earned value tracking and forecasting; simplifies metrics collection and analysis.
-
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.
-
5
GeneticSharp
GeneticSharp is a fast, extensible, multi-platform and multithreading
...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 client application template with GeneticSharp ready to run a Travelling Salesman Problem (TSP). A console application template with GeneticSharp, you just need to implement the chromosome and fitness function. A console application template with GeneticSharp ready to run a Travelling Salesman Problem (TSP). -
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. -
7
The J-Horizon is java based vehicle Routing problem software that uses the jsprit library to solve: Capacitated VRP, Multiple Depot VRP, VRP with Time Windows, VRP with Backhauls, VRP with Pickups and Deliveries, VRP with Homogeneous or Heterogeneous Fleet, VRP with Open or Closed routes, TSP, mTSP and various combination of these types. Latitude/Longitude is also supported.
-
8
Pharos
RTOS for Secure, Safe and Real-Time Systems
Pharos is a free open-source RTOS for secure, safe and real-time systems with the following characteristics: - Memory and enhanced time partitioning (TSP) - Native support for sporadic, periodic and aperiodic threads - Fixed-priority preemptive scheduler - Execution time protection (threads are prevented from executing for more time than they are configured to) - Small size (full image has ~100 to 300KiB text, ~30KiB data) - Hard real-time determinism - Fast critical sections - Prioritized nested interrupts - inter-partition communication with filters to protect unwanted access - Multicore support (RMP) - Supports ARM9, Cortex-A/R/M and Aarch64, RISC-V64 (64 bits) - The complete TestSuite (see below information) is run successfully for each platform in each release - Tested: more than 170 KLOC of requirement-based tests, executed for each board at each release - Up-to-date User Manual also available See our wiki page for more information. -
9
-
Add Two Lines of Code. Get Full APM.Works out of the box for Rails, Django, Express, Phoenix, and more. Monitoring exceptions and performance in no time.
-
10
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. -
11
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. -
12
QR-CERT. Free PKI Certificate Authority
PKI & Card Management System to issue and manage tokens & certificates
The QR-CERT software is a specialized package of applications dedicated for the development of a Public Key Infrastructure system as well as the cards personalization and management system. The software contains a number of functional modules, enabling a flexible selection of functionalities for implementation. The software is dedicated for large organizations and corporate environments, with a PKI infrastructure and microprocessor cards. The QR-CERT is a solution both for the companies... -
13
Satsuma .NET Graph Library
a delicious .NET graph library
Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal... -
14
A modeling and simulation tool for Routing problems on Graphs, tccrouter is a java desktop application that provides a 2d map for building graphs and simulating a variety of real world routing solutions: Shortest path, TSP, VRP, VRP-TW. Check Git repository. https://github.com/guilhebl/routerapp
-
15
tsp-problem-ga-aco-comparisson
Genetic Algorithm and Ant Colony to solve the TSP problem
This project compares the classical implementation of Genetic Algorithm and Ant Colony Optimization, to solve a TSP problem. It's possible to define the number of cities to visit , and also interactively create new cities to visit in a 2D spatial panel. A total distance is given for AG and ACO solution at end. -
16
What is QPF 2.6 ? QPF 2.6 (or Quantum Programming framework 2.6) is a free simple and easy to use framework dedicated to supporting programmers who are developing software for the D-wave one series of quantum computers.
-
17
TSP
traffic sharing platform for mobile networks
traffic sharing platform for mobile networks -
18
TSPLib.Net
TSPLib wrapper for .Net
...This project provides .Net library wrapping up library files loading code, implements distance functions and all the TSPLib features. If you'd like to test your graph tour searching algorithm on a TSP lib will save you hours of reading in a data and adjusting your code to ensure that result are comparable. Delivering as a dll with .Net wrapper and a zip archive with all the original data files from TSPLIB95. This is still BETA, if something is not working or you need some extra features then just let me know. Check WIKI for details on HOW TOs. ... -
19
TSP Qt
An interactive understanding of the symmetric Travel Salesman Problem
-
20
-
21
NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.
-
22
software educativo de aplicacion de metaheuristicas sobre problemas de grafos, TSP problema del agente viajero, ruta mas corta, arbol de expansion minima, etc.
-
23
Project aims at developing KNIME nodes, which provide tools for solving optimization problems, like TSP and function optimization. Two metaheuristic are available: Tabu Search and Simulated Annealing. Now we are working on: Evolutionary Algorithm.
-
24
JTime Manager is a java based desktop application designed to keep the time count for any activity, it's a great tool for developers who need to have a time record for example those who has to work under PSP/TSP or CMMI process
-
25
