the same as your TSP one (my whole
project was basically a copy of TSP):
https://github.com/davidglassborow/drools-planner/blob/vehicle_routing/drools-planner-examples/src/main/java/org/drools/planner/examples/tsp/domain/TravelingSalesmanTour.java#L96
and
https://github.com/davidglassborow
> D => Crew2
>> A => B => Crew1
>> B => A => B => Crew1
>How is this possible? That means that B is pointing both to A and to Crew1
?
>It's only a single pointer? VrpCustomer.getPreviousAppereance()
Indeed this is my problem. There seems to be mo
Some more details on my problem:
Here is an example of a vehicle routing solution, 2 crews and 4 Jobs A, B, C
and D.
The print out below is the solver and solutions found at each step (it
prints out each chain of jobs)
As you can see the initial solution is valid.
The next and last solutions are
, I've put together an example into my
fork of planner, showing a simplified example of how I am approaching it,
and the problem that can be replicated.
https://github.com/davidglassborow/drools-planner/tree/vehicle_routing
It is a very simple console app along the same lines as the hello wo
