Search Results for "tsp problem parallel"
Sort By:
Showing 31 open source projects for "tsp problem parallel"
View related business solutions-
Bright Data - All in One Platform for Proxies and Web ScrapingBright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
-
Top-Rated Free CRM SoftwareHubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
-
1
GeneticSharp
GeneticSharp is a fast, extensible, multi-platform and multithreading
... 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). -
2
LMAX Disruptor
High performance inter-thread messaging library
... extremely costly, so we created a framework which has "mechanical sympathy" for the hardware it’s running on, and that’s lock-free. This is not a specialist solution, it’s not designed to work only for a financial application. The Disruptor is a general-purpose mechanism for solving a difficult problem in concurrent programming. It works in a different way to more conventional approaches, so you use it a little differently than you might be used to. -
3
Geodesic
Geodesic is a DevOps Linux Toolbox in Docker
Geodesic is a robust Linux toolbox container, crafted to optimize DevOps workflows. This container comes fully loaded with all essential dependencies for a complete DevOps toolchain. It's designed to bring consistency and boost efficiency across development environments. It achieves this without the need for installing additional software on your workstation. Think of Geodesic as a containerized parallel to Vagrant, offering similar functionality within a Docker container context. -
4
LinDB
LinDB is a scalable, high performance, high availability database
LinDB is a scalable, high-performance, high-availability distributed time series database. A single server could easily support more than one million write TPS; With fundamental techniques like efficient compression storage and parallel computing, LinDB delivers highly optimized query performance. The multi-channel replication protocol supports any amount of nodes, and ensures the system's availability. Schema-free multi-dimensional data model with Metric, Tags, and Fields; The LinQL... -
New Plans, same great Auth0 | Auth0 by OktaIn our new Free Plan, you'll receive more MAUs than ever. You'll also be able to add Passwordless authentication, use your own custom domain, and more. Our expanded Paid Plans include increased connections, more MFA offerings, and more. Check out what's new.
-
5
PelicanHPC is an iso-hybrid (CD or USB) image that let's you set up a high performance computing cluster in a few minutes. A Pelican cluster allows you to do parallel computing using MPI. You can run Pelican on a single multiple core machine to use all cores to solve a problem, or you can network multiple computers together to make a cluster. The frontend node (either a real computer or a virtual machine) boots from the image. The compute nodes boot by PXE, using the frontend node as the server...
-
6
AntTSP
Traveling Salesman Problem (TSP) Solver
Fast Ant Colony Optimization TSP Solver -
7
SpiceDB
SpiceDB is the open source, Zanzibar-inspired authorization system
Open Source, Google Zanzibar-inspired permissions database to enable fine-grained access control for customer applications. Get started with the SpiceDB playground: https://play.authzed.com/ -
8
DETR
End-to-end object detection with transformers
PyTorch training code and pretrained models for DETR (DEtection TRansformer). We replace the full complex hand-crafted object detection pipeline with a Transformer, and match Faster R-CNN with a ResNet-50, obtaining 42 AP on COCO using half the computation power (FLOPs) and the same number of parameters. Inference in 50 lines of PyTorch. What it is. Unlike traditional computer vision techniques, DETR approaches object detection as a direct set prediction problem. It consists of a set-based... -
9
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.
-
Email and SMS Marketing SoftwareOur intuitive email marketing software to help you save time and build lasting relationships with your subscribers.
-
10
coarrays
A free Fortran 2008, 2018 coarrays course with notes and exercises
Coarrays are native Fortran means for SPMD parallel programming. At runtime multiple copies of the executable (called images) are executing asynchronously. The F2008 standard provides coarray syntax, remote calls, coarray data objects, allocatable coarrays, syncronisation, atomics, etc. F2018 adds new functionality, e.g. collectives, teams, events, more atomics. Coarrays are used extensively in CASUP library for HPC (https://cgpack.sourceforge.io). The course is aimed at experienced... -
11
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... -
12
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
13
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. -
14
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. -
15
Bat2015
Bachelor of Science (Informatik)
... in a network as you want. With a focus on the MILP methods we implement a load balancing and speed up the solving process in a multiplicative way. Sometimes we have super-linear speedup with a small set of hardware. With a splitting of problems, parallel computing and distributing the actual best solution to all running processes we solve CBP much faster than a sequential processing can do. -
16
QZAntics Chug For Windows
Chug allocates and locks all available memory on the system
... Flight Systems) should an errant parallel process or bad design cause a problem with adjacent processes. -
17
gxLibrary : C++ (CUDA+AMP+CPU)
C++ library for easy simulations on any CUDA/AMP/CPU or remote PC
Helps to program ( in C++) simulations or long-running calculations with many iterations. Easily write C++ code that is same as single-threaded ( or shorter and simpler) , and gxLibrary will compile and run that code as massive multi-threaded on any available GPU (CUDA/AMP) or CPU, either on local or remote PC. Write code functions once, just like they would be written for regular single-threaded cases - no need to write separate code for CUDA or AMP or CPU, or to modify code for parallel... -
18
TSP Qt
An interactive understanding of the symmetric Travel Salesman Problem
-
19
Parallel Super-Resolution is a multithreaded ImageJ plugin for super-resolution. Super-resolution is an image fusion and reconstruction problem, where an improved resolution image is obtained from several geometrically warped, low resolution images.
-
20
gpgmpi
An GPGMP in C++/OpenCL with improved time step algorithm
The need for speed is always a challenge for large-scale stochastic simulation. This software is based on a parallel stochastic simulation algorithm already implemented on Graphics Processing Unit (GPU) for inhomogeneous reaction-drift-diffusion systems. We suggest an improved choice of time step which turns out to be almost 3 or even more times fast with nearly identical accuracy. The software is now completely implemented in C++ and OpenCL which only depends on boost library and GPU vendor’s... -
21
grn_inference_multigpu
This project is a exhaustive search algoritm for multiple GPUs
Gene regulatory networks (GRN) inference is an important bioinformatics problem in which the gene interactions need to be deduced from gene expression data, such as microarray data. <br> Feature selection methods can be applied to this problem. A feature selection technique is composed by two parts: a search algorithm and a criterion function. Among the search algorithms already proposed, there is the exhaustive search where the best feature subset is returned, although its computational... -
22
-
23
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.
-
24
J-VRPsolver
Solve VRP with 1 warehouse and 1 vehicle type
a simple and effective vehicle routing problem’s solger using metaheuristic algorithms's like Tabu Search and Clark'n Wright. It's specialized in single deposit and singe vehicle's capacity VRP's istances. [mainly for educational purposes] -
25
A solution of the Traveling Salesman Problem using the Simulated annealing.