Displaying 1 to 5 from 5 results

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.


  •    DotNet

OsmSharp is a routing and OSM data processing library.

bounty-targets-data - This repo contains hourly-updated data dumps of Hackerone/Bugcrowd scopes that are eligible for reports


The last change was detected on Friday 10/12/2018 13:30 (UTC). New changes (if any) are picked up hourly. The code used to generate these files lives in the bounty-targets repo.

node-or-tools - Node.js bindings for or-tools vehicle routing problems

  •    C++

NodeJS bindings for or-tools Travelling Salesman Problem (TSP) and Vehicle Routing Problem (VRP) solvers.See API.md for documentation.

VRP-tabu - A Tabu Search pseudo-parallel algorithm for Vehicle Routing Problem

  •    C++

This repo contains the project of "Metodi ed Algoritmi di Ottimizzazione per il Problem Solving": a parallel algorithm for VRP with tabu search heuristic. This program reads data from a JSON file which holds all informations about customers, vehicles, depot and requests. This simple example shows a configuration of 3 customers to serve with 2 vehicles with max capacity of 400 and max work time of 350. Each customer has a name, a position, an amount of resources requested and an optional service time. In order to create the best routes it's necessary to know the cost of each travel from each customers (in this case the distance is the geometric distance).