Hi,
I hope someone can tell me what I am doing wrong.
I am trying to kind of do the same as the Vehicle Routing example.
My domain is:
- Consultant (the person that will drive to a DeliveryPlace and spent some
time there, each Consultant has a max total time available)
- DeliveryPlace (the place where a Consultant will drive to and spent some
time making a delivery)
- Location (a Consultant has a home and a DeliveryPlace has a location)
So basicly there could be X Consultants who has to make deliveries to Y
DeliveryPlace's. And I want to figure out the best way of doing that.
Right now my code does not find any doable moves:
16:51:57.654 [main] INFO o.d.p.c.c.g.DefaultGreedyFitSolverPhase - Phase
constructionHeuristic ended: step total (0), time spend (86), best score
(0hard/0soft).
16:51:57.658 [main] WARN o.d.p.c.l.DefaultLocalSearchSolverPhase -
Cancelled step index (0), time spend (89): there is no doable move.
Terminating phase early.
16:51:57.658 [main] INFO o.d.p.c.l.DefaultLocalSearchSolverPhase - Phase
localSearch ended: step total (0), time spend (90), best score
(0hard/0soft).
Here is the source code, modified from the Vehicle Routing example:
src.tar.gz <
http://drools.46999.n3.nabble.com/file/n4019907/src.tar.gz>
--
View this message in context:
http://drools.46999.n3.nabble.com/Drools-Planner-Vehicle-Routing-but-a-li...
Sent from the Drools: User forum mailing list archive at
Nabble.com.