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 invalid though, with the same job appearing more than once in a chain. At 109: B => Crew1 D => Crew2 A => B => Crew1 C => A => B => Crew1 2012-02-24 15:20:39,160 [main] DEBUG Step index (3), time spend (110), score (0hard/-17soft), initialized planning entity (Job D ( linked to Crew Crew2)). 2012-02-24 15:20:39,160 [main] INFO Phase construction heuristic ended: step total (4), time spend (110), best score (0hard/-17soft). At 127: D => Crew2 A => B => Crew1 B => A => B => Crew1 C => A => B => Crew1 2012-02-24 15:20:39,177 [main] DEBUG Step index (0), time spend (127), score (0hard/-15soft), new best score (0hard/-15soft), accepted move size (18) for picked step (Job B ( linked to Crew Crew1) => Job A ( linked to Job B)). 2012-02-24 15:20:39,191 [main] DEBUG Step index (1), time spend (141), score (0hard/-15soft), best score (0hard/-15soft), accepted move size (14) for picked step (Job D ( linked to Crew Crew2) => Crew1). 2012-02-24 15:20:39,206 [main] DEBUG Step index (2), time spend (156), score (0hard/-16soft), best score (0hard/-15soft), accepted move size (10) for picked step (Job C ( linked to Job A) => Job B ( linked to Job A)). 2012-02-24 15:20:39,223 [main] DEBUG Step index (3), time spend (173), score (0hard/-16soft), best score (0hard/-15soft), accepted move size (5) for picked step (Job A ( linked to Job B) => Job B ( linked to Job A)). 2012-02-24 15:20:39,239 [main] WARN Cancelled step index (4), time spend (189): there is no doable move. Terminating phase early. 2012-02-24 15:20:39,239 [main] INFO Phase local search ended: step total (4), time spend (189), best score (0hard/-15soft). 2012-02-24 15:20:39,239 [main] INFO Solving ended: time spend (189), best score (0hard/-15soft), average calculate count per second (1089). Best: D => Crew2 A => B => Crew1 C => A => B => Crew1 B => A => B => B => Crew1 -- View this message in context: http://drools.46999.n3.nabble.com/Drools-Planner-Vehicle-routing-problems... Sent from the Drools: User forum mailing list archive at Nabble.com.

Hi Ge0ffrey, I mean the initialised solution Sorry, the number is just the number of milliseconds as returns by the new solution event so at this point the solution is valid, its later steps where I get the problem ? Indeed this is my problem. There seems to be more than 1 instance of B. I've debugged my example code, and then issue seems to be: https://github.com/davidglassborow/drools-planner/blob/vehicle_routing/dr... The solver seems to be assigning the visit to be before itself ! If you look at: https://github.com/davidglassborow/drools-planner/blob/vehicle_routing/dr... you'll see I have added a check to your Visit.java, which doesn't display the same problem. So I'm not sure what is happening, domain objects seems to be cloned and assigned to themselves. I have checked and double-checked the code inline with your TSP example, I'm sure it's nothing stupid I've done but can't for the life of me see anything wrong. If you download the branch, and run the VehicleRoutingHelloWorld class, you'll see the problem occuring. What did you need to change to get that to work ? Was it just a case of adding another domicile, and then removing the return to domicile cost rule ? Cheers for the help, Dave -- View this message in context: http://drools.46999.n3.nabble.com/Drools-Planner-Vehicle-routing-problems... Sent from the Drools: User forum mailing list archive at Nabble.com.

Geoffrey, Sure, my clone method is virtually the same as your TSP one (my whole project was basically a copy of TSP): https://github.com/davidglassborow/drools-planner/blob/vehicle_routing/dr... and https://github.com/davidglassborow/drools-planner/blob/vehicle_routing/dr... Did you have to make any other changes to make multi TSP work ? Was it just a case of adding another domicile, and then removing the return to domicile cost rule ? Cheers, Dave -- View this message in context: http://drools.46999.n3.nabble.com/Drools-Planner-Vehicle-routing-problems... Sent from the Drools: User forum mailing list archive at Nabble.com.

Just pushed my vehicle routing prototype, it works pretty well :) Op 27-02-12 12:16, Geoffrey De Smet schreef: -- With kind regards, Geoffrey De Smet

I guess it's a matter of adjusting these 2 files to your needs: https://github.com/droolsjbpm/optaplanner/blob/master/optaplanner-example... https://github.com/droolsjbpm/optaplanner/blob/master/optaplanner-example... Maybe someone else in the community has done similar changes and is willing to share the implementation? On 30-05-14 03:05, Neb wrote:

On 11-06-14 09:30, Neb wrote: Learn XStream :) http://xstream.codehaus.org/ There are number of nice tutorials there. XStream is independent of OptaPlanner, but they work together nicely. Ask any questions related to the XML format on their mailing list (I am subscribed there too). Alternatively, use JAXB (which works nicely with OptaPlanner too).