Search Results for "travelling salesman problem java"
Sort By:
Showing 18 open source projects for "travelling salesman problem java"
View related business solutions-
Secure Cloud Storage for Files, Photos and Documents | pCloudStore, sync, and share your files securely with pCloud. Get up to 10 GB of free secure cloud storage and access your files from any device, anywhere.
-
Self-hosted password managerOn-premise solution with double encryption and certified development processes for maximum protection of corporate data. Zero‑knowledge architecture ensures your passwords never leave your infrastructure.
-
1
OR-Tools - Google Optimization Tools
Google's software suite for combinatorial optimization
Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others.... -
2
GeneticSharp
GeneticSharp is a fast, extensible, multi-platform and multithreading
...GeneticSharp and extensions (TSP, AutoConfig, Bitmap equality, Equality equation, Equation solver, Function builder, etc). A Blazor 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). -
3
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. -
4
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. -
Your go-to FinOps platformUnlike reporting-only FinOps tools, FinOpsly unifies cloud (AWS, Azure, GCP), data (Snowflake, Databricks, BigQuery), and AI costs into a single system of action — enabling teams to plan spend before it happens, automate optimization safely, and prove value in weeks, not quarters.
-
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
libfgen
Library for optimization using a genetic algorithm or particle swarms
libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported. -
7
DeliveryBoy's is one game implements the traveling salesman problem (TSP) into Android platform, using the AndEngine's API.
-
8
-
9
Awakener aims to provide a Java library for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.
-
All Things Performance and Partner Marketing, All in One PlaceAutomatically tie revenue back to campaigns, channels, publishers, and networks through marketing attribution. Spend less time juggling reports, and more time optimizing for growth by using a single operating solution for partner and performance marketing.
-
10
SwarmTSP is a library of swarm intelligence algorithms for the Traveling Salesman Problem. Currently, it implements Ant Colony Optimization and Consultant-Guided Search algorithms.
-
11
-
12
A solution of the Traveling Salesman Problem using the Simulated annealing.
-
13
Solution to the Travelling Salesman Problem using Genetic Algorithms and the GALib library. The application logic is written in C# and interface in WPF. Requires .Net 4.0 beta 2 or above.
-
14
-
15
Solving the travelling salesman problem with genetic (evolutionary) algorithms. The distance calculations are based on geographical coordinates. The progress of the algorithm is visualized with a geo-map and some statistics.
-
16
evoltsp is a GPL Java-Framework to solve Travelling Salesmen Problems using Evolutionary Strategies. Features a small example of how to optimize a 127-location TSP problem, pluggable Strategy Classes that contain trivial & more elaborated TSP solvers
-
17
-
18
JSalesman is a very efficient Travelling Salesman problem solver that produces high-quality outputs. JSalesman uses hierarchial and multi-level approaches to solve the problem fast.
- Previous
- You're on page 1
- Next
