Search Results for "tsp problem parallel"

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.

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...

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.

A solution of the Traveling Salesman Problem using the Simulated annealing.

A heuristic implementation for solving the Bottleneck Traveling Salesman Problem (BTSP) and related problems, such as the Maximum Scatter Traveling Salesman Problem (MSTSP).

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.