Search Results for "vehicle routing"

GraphHopper invests in an active open source community. Our flagships are the GraphHopper routing engine and jsprit, the toolkit for solving rich vehicle routing problems. We promote a fair & diverse mindset. jsprit is a Java based toolkit for solving rich traveling salesman problems (TSP) and vehicle routing problems (VRP). It is lightweight, flexible, easy-to-use, and based on a single all-purpose meta-heuristic. The GraphHopper routing engine is fast and memory-efficient, using Java. It runs...

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

openTCS is a platform-independent transportation control system (TCS) intended to manage fleets of automatic guided vehicles (AGVs), but can be used to manage virtually any automatic vehicle. It consists of an abstract kernel that implements replaceable algorithms and strategies (computation of routes, dispatching of orders to vehicles, scheduling of resources etc.), pluggable vehicle drivers that implement communication protocols and a graphical frontend for creating and visualizing logical...

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. It is fit for change and extension due to its modular design...

The J-Horizon is java based vehicle Routing problem software that uses the jsprit library to solve: Capacitated VRP, Multiple Depot VRP, VRP with Time Windows, VRP with Backhauls, VRP with Pickups and Deliveries, VRP with Homogeneous or Heterogeneous Fleet, VRP with Open or Closed routes, TSP, mTSP and various combination of these types. Latitude/Longitude is also supported.

FreeVRS (Free Vehicle Routing Solutions) is a Free and Open Source application to solve Vehicle Routing Problems (VRP) using different heuristic approaches.

This is a class library written in C# for processing OpenStreetMap XML file extracts into a SQLite database for routing with different vehicle types and restrictions. Before rating or contributing please see the README file for a more complete summary and a list of todos.

The Two-Echelon Vehicle Routing Problem

ESA-VRP implements several heuristics for Capacitated Vehicle Routing Problem. It can be used as: standalone application, sharable library or service.

Multi-Depot Vehicle Routing Problem with Geographic Information System (GIS) OpenJUMP

Simple POSIX multithread Ant Colony Optimizer framework currently for solving Vehicle Routing Problem. Supports UDP, file synchronizatoin between computers.

A mapping application for OpenStreetMap that renders OSM or MapQuest tiles and does basic routing from a built-in database. The main focus of this project is the development of a high-performance routing engine that can handle a variety of routing and vehicle constraints on demand without additional pre-processing of the road network. An additional goal is the development of a class library centered around a built-in, object-oriented database used for processing and storing OSM map data...

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]

Pick-up and Delivery Vehicle Routing Problem with Time Windows and Multiply Types of Googs. Ant Colony optimization approach

VRPSolver is a wizard-like application which solves a basic Vehicle Routing Problem (VRP) using the Savings Heuristic Method invented by Clarke and Wright in 1964.

VRP (Vehicle Routing Problem) Simulator

(Multi-Agent) Transport Planner is (currently) a dynamic single agent transport planner for vehicle routing problems and dial-a-ride problems. MatPlan uses a (very quick) standard insertion technique to insert orders one by one into a set of routes.

Aim of the project is to develop a continious evolutionary algorithm for solving vehicle routing problems.

The proute engine is a library for processing and displaying vehicle routing information. It typically takes as input a vehicle routing problem instance as well as a solution, and can output graphical views of this data (nodes, routes, etc).