Search Results for "tsp"
Sort By:
Showing 47 open source projects for "tsp"
View related business solutions-
Plan more projects with Worksection. Use Gantt chart and Kanban boards to organize your projects, get your team onboard and assign tasks and due dates.
-
Build unique experiences across SMS, MMS, Facebook Messenger, and WhatsApp – with our unified messaging APIs.
-
1
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... -
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
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.
-
KrakenD is a high-performance API Gateway optimized for resource efficiency, capable of managing 70,000 requests per second on a single instance. The stateless architecture allows for straightforward, linear scalability, eliminating the need for complex coordination or database maintenance.
-
5
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... -
6
-
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... -
9
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... -
ConnectWise CPQ, formerly ConnectWise Sell, is a professional quote and proposal automation software for IT solution providers. ConnectWise CPQ offers a wide range of tools that enables IT solution providers to save time, quote more, and win big. Top features include professional quote or proposal templates, product catalog and sourcing, workflow automation, sales reporting, and integrations with best-in-breed solutions like Cisco, Dell, HP, and Salesforce.
-
10
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. -
11
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... -
12
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. -
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
AirTSP
Simulated Airline Travel Solution Provider Library
AirTSP is also named AirTSP (TSP standing for Travel Service Provider). That project aims at providing a clean API and a simple implementation, as a C++ library, of an Airline Schedule Management System. It is intended to be used in simulated environments only: it is not designed to work in the real-world of Airline IT operations. AirTSP/AirTSP makes an extensive use of existing open-source libraries for increased functionality, speed and accuracy. In particular the Boost (C++ Standard... -
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
quickGA-m
A quick (messy?) genetic algorithm to solve TSP
A quick genetic algorithm to solve TSP scenarios. Written in Matlab. Circa June 2012. -
19
TSP Qt
An interactive understanding of the symmetric Travel Salesman Problem
-
20
-
21
TSPLib.Net
TSPLib wrapper for .Net
TSPLib is a set of Traveler Salesman and related graph problems gathered by the Heidelberg university. 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... -
22
de-ess
De-essing software to reduce sibilance in speech using TSP
This de-esser uses a novel approach called Temporal Sibilance Processing. The idea is to distinguish between fricatives and voiced sections of the speech signal by the number of zero crossings in time. Most of the speech file is left untouched (the samples are directly copied from source to destination). Only fricatives that are long enough and loud enough are filtered. The advantage of this approach over traditional approaches is that the clarity of the remaining speech is completely unaffected. -
23
-
24
-
25
DeliveryBoy's is one game implements the traveling salesman problem (TSP) into Android platform, using the AndEngine's API.