Search Results for "vehicle routing problem"
Sort By:
Showing 28 open source projects for "vehicle routing problem"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
GraphHopper Routing Engine
Open source routing engine for OpenStreetMap
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. ... -
2
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. OR-Tools is written in C++, but comes with wrappers for Python, C# and Java. ... -
3
Open Source Routing Machine
Open Source Routing Machine - C++ backend
...Match snaps noisy GPS traces to the road network in the most plausible way. Trip solves the Traveling Salesman Problem using a greedy heuristic. Tile generates Mapbox Vector Tiles with internal routing metadata. To quickly try OSRM use our demo server which comes with both the backend and a frontend on top. The easiest and quickest way to setup your own routing engine is to use Docker images we provide. We base our Docker images (backend, frontend) on Debian and make sure they are as lightweight as possible. -
4
JuMP
Modeling language for Mathematical Optimization
JuMP is a modeling language and collection of supporting packages for mathematical optimization in Julia. JuMP makes it easy to formulate and solve a range of problem classes, including linear programs, integer programs, conic programs, semidefinite programs, and constrained nonlinear programs. JuMP is used to solve large-scale inventory routing problems at Renault, schedule trains at Thales Inc., plan power grid expansion at PSR, and route school buses. -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
5
NVIDIA cuOpt
GPU accelerated decision optimization
NVIDIA cuOpt is a GPU-accelerated optimization engine designed to solve complex mathematical optimization problems at large scale. It supports a range of optimization models including linear programming (LP), mixed integer linear programming (MILP), quadratic programming (QP), and vehicle routing problems (VRP). Built primarily in C++, cuOpt leverages NVIDIA GPUs to deliver near real-time solutions for optimization tasks involving millions of variables and constraints. The platform provides multiple interfaces, including C, Python, and server APIs, allowing developers to integrate optimization capabilities into applications and services. cuOpt is designed for high-performance environments and can be deployed across cloud, hybrid, or on-premise infrastructures. ... -
6
Kimi K2
Kimi K2 is the large language model series developed by Moonshot AI
...The model family includes variants like a foundational base model that researchers can fine-tune for specific use cases and an instruct-optimized variant primed for general-purpose chat and agent-style interactions, offering flexibility for both experimentation and deployment. With its high-dimensional attention mechanisms and expert routing, Kimi-K2 excels across benchmarks in live coding, math reasoning, and problem solving. -
7
Refine
Build your React-based CRUD applications, without constraints
...It doesn’t ship with any pre-styled components or UI by default. Instead, you can use any custom design or UI framework for 100% control over styling. Not ready for going headless yet? No problem. Refine supports four powerful UI frameworks out-of-the box. Refine is a React-based framework for the rapid development of web applications. It eliminates repetitive tasks demanded by CRUD operations and provides industry-standard solutions for critical parts like authentication, access control, routing, networking, state management, and i18n. ... -
8
openTCS
open Transportation Control System
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... -
9
LaPath
Learning Automata algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. Learning Automata (LA) are adaptive mechanisms requiring feedback from the executing environment to converge to certain states. -
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
10
MyCAT
Active, high-performance open source database middleware
MyCAT is an Open-Source software, “a large database cluster” oriented to enterprises. MyCAT is an enforced database which is a replacement for MySQL and supports transaction and ACID. Regarded as MySQL cluster of enterprise database, MyCAT can take the place of expensive Oracle cluster. MyCAT is also a new type of database, which seems like a SQL Server integrated with the memory cache technology, NoSQL technology and HDFS big data. And as a new modern enterprise database product, MyCAT is... -
11
jsprit
Open source toolkit for solving rich vehicle routing problems
...Possibility to define additional stateless and stateful constraints/conditions to account for the richness of your problem. 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. -
12
Helpdezk
HelpDEZk is a powerfull software that manages requests/incidents.
HelpDEZk is a powerfull software that manages requests/incidents. It has all the needed requirements to an efficient workflow management of all processes involved in service execution. This control is done for internal demands and also for outsourced services. HelpDEZk can be used at any company’s area, serving as an support to the shared service center concept, beyond the ability to log all the processes and maintain the request’s history, it can pass it through many approval... -
13
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.
-
14
FreeVRS (Free Vehicle Routing Solutions) is a Free and Open Source application to solve Vehicle Routing Problems (VRP) using different heuristic approaches.
-
15
Object Oriented Streetmap
C# class library for processing OpenStreetMap data
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. -
16
VRP2E
Two-Echelon Vehicle Routing Problem
The Two-Echelon Vehicle Routing Problem -
17
ESA-VRP implements several heuristics for Capacitated Vehicle Routing Problem. It can be used as: standalone application, sharable library or service.
-
18
ACOptim
Ant Colony Optimizer
Simple POSIX multithread Ant Colony Optimizer framework currently for solving Vehicle Routing Problem. Supports UDP, file synchronizatoin between computers. -
19
OSM Explorer
Basic routing and spatial functions using OpenStreetMap data
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 such that external dependencies (e.g. external database servers) are minimized. -
20
J-VRPsolver
Solve VRP with 1 warehouse and 1 vehicle type
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] -
21
Lagrange_Motocross
2D motorcycle simulator done using Lagrangian equations of motion
2D simulation game using exlusively Lagrangian equations of motion. It's a 2D motocross game similar to X-Moto, ActionSupercross and such. Some stability issues persist but mostly it's good already. I shall compile it soon for Windows: one of the problems is that Windows compilers must periodically be reinstalled, and that's annoying. Using Lagrangians in games is not a well documented thing, but it allows to achieve exellent results in very little time, soon after a good parametrization... -
22
comb-needle hotspot evaluation
opnet project for WSN comb-needle model
...CN model uses the push-pull strategy, when the sensor detects specific events, it will periodically push (broadcast) the information throughout the network, when user want to get the information, then a pull-based information query will be exploited. A sensor node generating a large number of events will always replicate its data along the same path using the same nodes. Hence, nodes located in above routing path have to forward a high amount of traffic and become so-called "hotspots", which cost much more energy and typically die at a very early stage. This is an opnet project which evaluates the comb-needle hotspot problem. Author: Endong Tong, Wenjia Niu, Gang Li -
23
-
24
Pick-up and Delivery Vehicle Routing Problem with Time Windows and Multiply Types of Googs. Ant Colony optimization approach
-
25
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.
