Search Results for "tsp problem parallel"
Sort By:
Showing 51 open source projects for "tsp problem parallel"
View related business solutions-
BackBox seamlessly integrates with network monitoring and NetOps platforms and automates configuration backups, restores, and change detection. BackBox also provides before and after config diffs for change management, and automated remediation of discovered network security issues.
-
Manage your enterprise’s compensation lifecycle and accurately recognize top performers with a digitized, integrated system. Keep employees invested and your HR team in control while preventing compensation chaos.
-
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
Hermione
Browser test runner based on mocha and wdio
Hermione is a utility for integration testing of web pages using WebdriverIO and Mocha. If you are familiar with WebdriverIO and Mocha, you can start writing and running tests in 5 minutes! You need to install Hermione via npm and add a tiny config to your project. When tests are run one by one, it takes a lot of time. Hermione can run tests in parallel sessions in different browsers out of the box. Running of too many tests in parallel can lead to the overloading of the main process CPU usage... -
4
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. -
YesEvents offers a comprehensive suite of services that spans the entire conference lifecycle and ensures every detail is executed with precision. Our commitment to exceptional customer service extends beyond conventional boundaries, consistently exceeding expectations and enriching both organizer and attendee experiences.
-
5
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... -
6
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...
-
7
AntTSP
Traveling Salesman Problem (TSP) Solver
Fast Ant Colony Optimization TSP Solver -
8
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/ -
9
Cuda Simulated Annealing GPU Route Plan
An Optimized GPU-Accelerated Route Planning of Multi-UAV Systems Using
... increase the computation performance. Therefore, this study focuses to discuss and solve the route planning problem for multi-UAV systems by using optimization techniques based on an evolutionary algorithm: simulated annealing. The travel cost and execution time are downsized in this work by optimization on algorithm and code. We implemented CPU based parallel solution to compare results with the GPU-accelerated one. The efficiency and the effectiveness of our parallelized and optimized solution -
Desktop Central is a unified endpoint management (UEM) solution that helps in managing servers, laptops, desktops, smartphones, and tablets from a central location.
-
10
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... -
11
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... -
12
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.
-
13
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... -
14
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... -
15
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... -
16
Adaptive Search
Adaptive Search is a constraint-based Local Search method.
Adaptive Search is a generic, domain-independent constraint-based Local Search method. This metaheuristic takes advantage of the structure of the problem in terms of constraints and variables in order to guide the search. The input of the method is a CSP, defined as a triple (X;D;C), where X is a set of variables, D is a set of domains (i.e., finite sets of possible values for each variable), and C a set of constraints restricting the values that the variables can... -
17
nodes-pi
nodes-pi : use your cluster for usual tasks
If you are the happy owner of a raspberry pi, you surely seen that it is relatively powerful, but if you open many of your favourite applications (openoffice, lyx, jupyter notebook, an instance of your favourite web browser etc.- I call them usual tasks): your raspberry pi looses its strength. In this project I would like to show how to use a small cluster of raspberry pi that solves this problem. First search the less load average node, then launch the application on it, then using X11... -
18
Recursive Directory Removal
Recursive Directory Removal
https://github.com/mhisoft/rdpro -
19
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. -
20
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. -
21
Ship Lock Scheduling
Scheduling lockages at ship locks with several parallel lock chambers
This Java software includes algorithms of combinatorical optimization for the NP-hard offline ship lock scheduling problem. Solutions and performed computations can be displayed graphically. Besides, there is a framework for generating test instances and running these in parallel, as well as R/JGR code for statistical evaluation. Some tools for estimating the quality of calculated solutions will be further improved. Initially the software was developed within a project of TU Berlin regarding... -
22
... by search engines and other progam in windows etc. Demo vid (older version): http://www.youtube.com/watch?v=nFH2FB7OOHc v1.3 - Fixed problem with files attributes v1.4 - App Speed improvement v1.5 - Parallel task processing - can't get much better then this one (THIS VERSION IS ONLY ONLY AN EXPERIMENT, AND MIGHT NOT WORK CORRECTLY, TO BE SAVE DOWNLOAD ONLY v1.4) You nead .NET 2.0 or .NET 4.0 liblaries to run this program.
-
23
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. -
24
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. -
25