Search Results for "tsp problem parallel"
Sort By:
Showing 14 open source projects for "tsp problem parallel"
View related business solutions-
Red Hat Enterprise Linux on Microsoft AzureRed Hat Enterprise Linux (RHEL) on Microsoft Azure provides a secure, reliable, and flexible foundation for your cloud infrastructure. Red Hat Enterprise Linux on Microsoft Azure is ideal for enterprises seeking to enhance their cloud environment with seamless integration, consistent performance, and comprehensive support.
-
Secure remote access solution to your private network, in the cloud or on-prem.OpenVPN is here to bring simple, flexible, and cost-effective secure remote access to companies of all sizes, regardless of where their resources are located.
-
1
AntTSP
Traveling Salesman Problem (TSP) Solver
Fast Ant Colony Optimization TSP Solver -
2
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... -
3
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... -
4
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... -
Payroll Services for Small Businesses | QuickBooksEasily pay your team and access powerful tools, employee benefits, and supportive experts with the #1 online payroll service provider. Manage payroll and access HR and employee services in one place. Pay your team automatically once your payroll setup is complete. We'll calculate, file, and pay your payroll taxes automatically.
-
5
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. -
6
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... -
7
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.
-
8
DCTV
DUAL CONSTRAINED TV-BASED REGULARIZATION ON GRAPHS
... of the TV problem may be solved by means of fast parallel proximal algorithms. On denoising and deblurring examples, the proposed approach is shown not only to perform better than recent TV-based approaches, but also to perform well on arbitrary graphs instead of regular grids. The proposed method consequently applies to a variety of other inverse problems including image fusion and mesh filtering. -
9
caseGen
... [BATCH], [ANALYZE] and [OPTIMIZE] cases in OpenFOAM and others
'caseGen' allows you to simplify your numerical simulation problem! Actual its not fairly tested so please contact me if you see any refinements or found bugs. -
Our Free Plans just got better! | Auth0 by OktaYou 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 secuirty. Auth0 now, thank yourself later.
-
10
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] -
11
A solution of the Traveling Salesman Problem using the Simulated annealing.
-
12
CFD scientific software. Provides simulation of 3D CFD problem based on Quasi-Gas Dynamics approach with radiation processes token into account. Lots of spectral intervals are considered. Parallel MPI/OpenMP-based implementation is provided.
-
13
A heuristic implementation for solving the Bottleneck Traveling Salesman Problem (BTSP) and related problems, such as the Maximum Scatter Traveling Salesman Problem (MSTSP).
-
14
mt-simulated-annealing
Multithreaded Simulated Annealing core in C
A multi threading simulated annealing which can be used to solve any optimization problem running in parallel in all machine cores. Optimization problem definition is open and explained through examples. It is implemented in C and only requires libpthread for running.
- Previous
- You're on page 1
- Next