HVRP modification problem

Hello everyone,

My name is Olga, I am a Master student at Monash University in Melbourne.
I am doing the Master thesis project now, and it is about waste management.
The idea is to find an optimal route for a garbage collection taking into account the capacity of the garbage truck, fuel costs, fuel amount, distance etc.
For the moment, I would like to use the GraphHopper JSPRIT library, but there are a few questions I’d like to ask:

  1. What algorithm are you using for VRP solution?

  2. Is there a list of methods() available? 'Cause I couldn’t find it, and I had to go through the examples and look for the methods.

Thank you in advance!

The meta-heuristic is of type large neighborhood search which combines elements of simulated annealing and threshold acceptance. The basic principle is from Schrimpf et al. (2000). Additionally, it is very much inspired by Pisinger and Ropke (2007)).

No, there is no such overview. The best way is - I think - to start from the examples.
Good speed for your thesis!

Hi, are you sure you’ve got a node routing problem and not an arc routing problem? Jsprit does node routing and garbage collection is more commonly solved as an arc routing problem.