graphhopper/jsprit

jsprit is a java based, open source toolkit for solving rich vehicle routing problems

jsprit's Issues

enhance SolutionPrinter to print out route stopps

Add pickup and delivery

this does not mean enroute pickup and delivery. Either the pickup or the delivery must take place in a depot

prematureBreak based on "variationCoefficient" in the algo-config file does not work in the SimpleExample

40000

0.001
2000

According to config, the iteration should stop after 2000 iterations.But it runs up 40000 iterations.

Error when reading algorithm from file

reading an algorithm-file from any local folder returns error - cannot find file

add benchmark for vrp with backhauls

Issue solved

Add example comparing two algorithms

design algorithm

here: ShipmentInsertionCalculator

Add example time-dependent vrp

design stable API to open up jsprit to create whole new algorithms from scratch

currently algorithms can only be customized via the algorithm-xml-file which is fine but it prevents users from building whole new algorithm (using availbable modules) with custom objective functions

All example in wiki assume output folder - if it does not exist, create it automatically

Document algorithm config and algorithm customizing

code shipment-io

problem readers/writer

dial a ride problem builder and solver

benchmark darp

design rapi

test pd-problem and algorithm

code darp

speed up computation to better deal with large (cordeau-)instances (finite fleet and multiple depots)

better comp time can be achieved by:

• switching off time-window updates (since there are no time-windows)
• clustering customers (i.e. defining a neighborhood)
• improving vehicleFleetManager such that penaltyVehicles are only activated if needed (now they are always considered)

add benchmark for vrp with pickup and deliveries

refactor vehicle-type from VehicleImpl

adjusts CalculateServiceInsertionOnRouteLevel the it was done with CalculateServiceInsertion

replace internal marginal cost calc with MarginalCalculus and add interface to route level costs estimates

code problem

data and builders

design/code pd-constraints

Add VRP with Backhauls (incl. documentation)

Add example heterogeneous fleet

add benchmark-wiki for multiple depot wiki with downloadable algorithm-config

add benchmark for vrp with time windows

Add PenaltyVehicleType to better deal with penalty vehicles

relax/code rapi

code additional builders and factories to decouple/hide implementation

add benchmark for capacitated vrp

add prematureBreak configuration to algorithm config

add and improve javadocs for basic classes

benchmark pd

Add example vrp with time windows

extend analysis

e.g. to plot shipments

enhance prematureBreak of algorithm based on percentage change

currently it is solely based on iterations

Create interface to MATSim

design darp

code pd-algorithm

code local insertionCalc
code routeLevel insertionCalc

Add example capacitated vrp

AlgoConfig: in prematureBreak the sequence of iterations and threshold should not matter

Delivery-Points dependant on specific depot

Hi,

congrats for the awesome project, it looks really great!

I've got a feature request where there's a dependency between deliverys and depots, i.e. a multi-depot problem where a delivery can only be delivered from a specific depot.

Example:
Two depots, Depot A hosts Apples, B hosts Books.
Five Deliverys: 1 (gets Apples), 2 (Apples), 3 (Books), 4 (Apples + Books), 5 (Books)

Currently it's possible to solve the problem only if it doesn't matter from which depot the customers get their product, but if there are different products like in this example, it's more complicated. It would be great if something like the following would be possible:

Service.Builder.newInstance("1", 1).setCoord(Coordinate.newInstance(5, 7)).setDepot(...)

or

Service.Builder.newInstance("1", 1).setCoord(Coordinate.newInstance(5, 7)).setDepotCoord(...)

i.e. if one could link the service and the depot it gets deliverd from.

create benchmarker to benchmark algorithms

Add example multiple depot vrp

design pd-problem

test rapi

multiple depot vrp example is extremely slow since too many redundant vehicle-types have been defined

Add example reading and solving classical VRP instances

test darp