Displaying 1 to 7 from 7 results

valhalla - Open Source Routing Engine for OpenStreetMap

  •    C++

Valhalla is an open source routing engine and accompanying libraries for use with OpenStreetMap data. Valhalla also includes tools like time+distance matrix computation, isochrones, elevation sampling, map matching and tour optimization (Travelling Salesman). Technical documentation for the various components of the library can be found here: docs. Service API documentation as well as links to a variety of technical descriptions are provided within the valhalla-docs repository.

osrm-backend - Open Source Routing Machine - C++ backend

  •    C++

High performance routing engine written in C++14 designed to run on OpenStreetMap data. To quickly try OSRM use our demo server which comes with both the backend and a frontend on top.

som-tsp - Solving the Traveling Salesman Problem using Self-Organizing Maps

  •    Python

This repository contains an implementation of a Self Organizing Map that can be used to find sub-optimal solutions for the Traveling Salesman Problem. The instances of the problems that the program supports are .tsp files, which is a widespread format in this problem. All the source code can be found in the src directory, while a report and brief presentation slides (in Spanish) can be found in the report folder. However, for a complete read on the topic, you can read my blog post explaining this implementation and its evaluation. This code is licensed under MIT License, so feel free to modify and/or use it in your projects. If you have any doubts, feel free to contact me or contribute to this repository by creating an issue.




jsprit - Toolkit for solving rich vehicle routing problems

  •    Java

jsprit is a java based, open source toolkit for solving rich traveling salesman (TSP) and vehicle routing problems (VRP). It is lightweight, flexible and easy-to-use. jsprit can solve problems with pickups and deliveries, back hauls, heterogeneous fleets, finite and infinite fleets, multiple depots, time windows, open routes, different start and end locations, multiple capacity dimensions, initial loads etc.

tsp - Solutions to the Traveling Salesman Problem

  •    Python

Two implementations of solutions to the Traveling Salesman Problem in Python 3. The first solution brute forces all permutations and is guaranteed to find the optimal solution for visiting all points.

Genetic-Algorithm-for-the-Traveling-Salesman-Problem - A population based stochastic algorithm for solving the Traveling Salesman Problem

  •    Java

A population based stochastic algorithm for solving the Traveling Salesman Problem. This program is also capable of producing a 2D heat map for determining the optimal parameters but I have not included an image of this.






We have large collection of open source products. Follow the tags from Tag Cloud >>


Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.