Vehicle Routing Problem
The Vehicle Routing Problem (VRP) optimizes the routes of delivery trucks, cargo lorries, public transportation (buses, taxis and airplanes) or technicians on the road, by improving the order of the visits. This routing optimization heavily reduces driving time and fuel consumption compared to manual planning:
OptaPlanner is flexible enough to handle any VRP variant. It includes examples of CVRP (Capacitated Vehicle Routing Problem) and VRPTW (Vehicle Routing Problem with Time Windows).
Fork our Vehicle Routing application and customize that template to your needs.
What is OptaPlanner?
OptaPlanner is the leading Open Source Java™ AI constraint solver to optimize the Vehicle Routing Problem, the Traveling Salesman Problem and similar use cases. It covers any type of fleet scheduling, such as routing of airplanes, trucks, buses, taxis, bicycles and ships, regardless if the vehicles are transporting products or passengers or if the drivers are delivering services.
OptaPlanner is a lightweight, embeddable planning engine. It enables everyday Java™ programmers to solve optimization problems efficiently. It is also compatible with other JVM languages (such as Kotlin and Scala). Constraints apply on plain domain objects and can call existing code. There’s no need to input constraints as mathematical equations. Under the hood, OptaPlanner combines sophisticated Artificial Intelligence optimization algorithms (such as Tabu Search, Simulated Annealing, Late Acceptance and other metaheuristics) with very efficient score calculation and other state-of-the-art constraint solving techniques.
OptaPlanner is open source software, released under the Apache License. It is written in 100% pure Java™, runs on any JVM and is available in the Maven Central repository too.
What is the Vehicle Routing Problem?
Many enterprises face a vehicle routing problem daily: determine the optimal order to deliver a number of items to number of locations with a fleet of vehicles. They face this problem to restock their shops, to deliver products/services to customers, to fulfill maintenance on their devices, … For example, truck routing with Google Maps:
Scaling out
OptaPlanner scales out on the Vehicle Routing Problem thanks to incremental score calculation, nearby selection, shadow variables and - of course - advanced construction heuristics and metaheuristics.
Integration with real maps
As demonstrated in OptaWeb Vehicle Routing, integration with Google Maps or OpenStreetMap is straightforward:
Related videos
Related blog posts
-
Thu 9 May 2019
Geoffrey De Smet
-
Mon 19 November 2018
Sudheer Chekka
-
Wed 3 June 2015
-
Tue 19 May 2015
Tomáš David
-
Fri 20 March 2015
-
Tue 10 March 2015
-
Tue 27 January 2015
-
Tue 2 September 2014
-
Tue 6 August 2013
- Download and unzip.
-
Run
runQuickstarts.sh(Linux/macOS)
orrunQuickstarts.bat(Windows).
-
Thu 25 November 2021
Want to talk to the experts? Red Hat offers certified binaries with enterprise consulting. Contact optaplanner-info for more information.
-
Stockholm, Sweden - Sun 6 February 2022
- AI maintenance scheduling with OptaPlanner on Quarkus by Geoffrey De Smet
-
Brno, Czech Republic - Thu 27 January 2022
- Artificial Intelligence on Quarkus: I love it when an OptaPlan comes together by Geoffrey De Smet
-
Tue 26 October 2021
Radovan Synek
-
Thu 14 October 2021
Walter Medvedeo
-
Tue 12 October 2021
Christopher Chianelli
-
Tue 5 October 2021
-
Wed 15 September 2021
-
Thu 19 August 2021
Lukáš Petrovický
-
Mon 26 July 2021
-
Maintenance scheduling
Thu 11 November 2021
-
Optimized order picking in warehouses and supermarkets
Mon 25 October 2021
-
A modern OO/FP constraint solver
Mon 13 September 2021
-
Business processes task optimization in Kogito
Mon 6 September 2021
-
School timetable optimization
Sun 5 September 2021
-
Schedule incoming calls real-time
Sun 22 August 2021
-
Unit testing constraints
Mon 8 March 2021