Search Results for "tsp problem parallel"
Sort By:
Showing 12 open source projects for "tsp problem parallel"
View related business solutions-
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
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
...All course materials are released under BSD license. We welcome contributions, provided you are happy to release your work under BSD license. We welcome comments and problem reports. -
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. -
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... -
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
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
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.
-
7
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. -
8
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] -
9
A solution of the Traveling Salesman Problem using the Simulated annealing.
-
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
10
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.
-
11
A heuristic implementation for solving the Bottleneck Traveling Salesman Problem (BTSP) and related problems, such as the Maximum Scatter Traveling Salesman Problem (MSTSP).
-
12
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