Search Results for "vehicle routing problem"
Sort By:
Showing 29 open source projects for "vehicle routing problem"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
1
Open Source Routing Machine
Open Source Routing Machine - C++ backend
... 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. -
2
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. It runs... -
3
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... -
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. -
No-Nonsense Code-to-Cloud Security for Devs | AikidoAikido provides a unified security platform for developers, combining 12 powerful scans like SAST, DAST, and CSPM. AI-driven AutoFix and AutoTriage streamline vulnerability management, while runtime protection blocks attacks.
-
5
Refine
Build your React-based CRUD applications, without constraints
With Refine you can have it all without compromising your freedom or facing constraints. Refine is headless by design. 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... -
6
MyCAT
Active, high-performance open source database middleware
... is combined with the traditional database and new distributed data warehouse. In a word, MyCAT is a fresh new middleware of database. MyCAT ’s objective is to smoothly migrate the current stand-alone database and applications to cloud side with low cost and to solve the bottleneck problem caused by the rapid growth of data storage and business scale. -
7
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... -
8
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. In the context of network routing, LA residing at intermediate nodes along a path, exploit feedback from the destination node for reducing... -
9
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... -
Gen AI apps are built with MongoDB AtlasMongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
-
10
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. It is fit for change and extension due to its modular design... -
11
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.
-
12
FreeVRS (Free Vehicle Routing Solutions) is a Free and Open Source application to solve Vehicle Routing Problems (VRP) using different heuristic approaches.
-
13
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. -
14
VRP2E
Two-Echelon Vehicle Routing Problem
The Two-Echelon Vehicle Routing Problem -
15
ESA-VRP implements several heuristics for Capacitated Vehicle Routing Problem. It can be used as: standalone application, sharable library or service.
-
16
-
17
Lagrange_Motocross
2D motorcycle simulator done using Lagrangian equations of motion
... of a given physical system was found. The problem is collisions... they are more problematic to do. The near-end of this little game is to get started with using Lagrangians in games; the far-end is to provide groung for creating a 3D rally game using Lagrange equations of motion, one that fixes certain shortcomings of the CTruck3D _Open . Ah very much thank to the Maxima project !! Without that program the calculations would have been impossible to do! -
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... -
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
comb-needle hotspot evaluation
opnet project for WSN comb-needle model
... 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 -
22
Pick-up and Delivery Vehicle Routing Problem with Time Windows and Multiply Types of Googs. Ant Colony optimization approach
-
23
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.
-
24
-
25
Passive Autoconfiguration for Mobile Ad hoc Networks (PACMAN) is an efficient and robust distributed solution to the IP address autoconfiguration problem. Address conflict detection is based on anomalies in the routing protocol traffic.
