forked from graphhopper/jsprit
-
Notifications
You must be signed in to change notification settings - Fork 0
More Examples
jsprit edited this page Jan 25, 2014
·
40 revisions
The bullet points show you what the respective example covers.
- reading a classical VRP instance (here the Solomon instance C101),
- plotting the problem,
- reading and running a predefined algorithm,
- plotting the solution.
- reading a classical VRP instance (here the Solomon instance C101),
- creating two different predefined algorithms,
- analysing their search-progress and computation time,
- speeding them up.
- the description of building blocks of algorithm config
- modifying existing algorithms
- reading and creating the modified algorithm
- setting up a VRP with Multiple Depots
- defining depots, vehicles and their types
- dealing with finite fleet size
- adding penalty vehicles to allow invalid solution temporarily
- defining and creating vehicles and their types
- defining services with time-windows and service times
- defining a problem with infinite fleet-size
- reading, creating and running an algorithm
- loading a network
- loading Carriers with their VehicleRoutingProblem and their locations based on the network
- defining the routing problem, i.e. transforming the problem into a jsprit-vrp
- loading a vehicle-routing-algorithm
- solving the problem
- transforming problem and solution to MATSim-Carrier again and
- visualize the solution dynamically
- defining and creating pickup and deliveries
- defining backhaul constraint
- defining and creating depot-bounded pickups and deliveries
- defining and creating pickups and deliveries
- illustrating different problem types,
- specifying heterogeneous fleet with its vehicles and vehicle-types,
- specifying the algorithm,
- benchmarking the algorithm