Search Results for "tsp problem parallel"

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

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.

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 the Kiel Canal. ...

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