different vehicles having different cost per delivery #3859
Unanswered
prasanik
asked this question in
Routing (and legacy CP) questions
Replies: 1 comment
-
|
Can anyone help here please? @Mizux ? |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
I have a fleet of vehicles where each vehicles charge a different amount per each drop it makes. What is the best way to achieve the optimum solution such that the vehicle having the least amount per drop gets the most number of nodes assigned? I tried using SetFixedCostOfVehicle. But I suspect it gets used only to decide which vehicle gets picked up and which gets dropped in case of having more vehicles available than required. I don't think it gets used in deciding the number of nodes assigned to different vehicles. Am I right? And other than using SetFixedCostOfVehicle, is there any way I can achieve it?
Also note that I have my own algo which is used to come up with an initial solution which then gets passed to the solver. So if my guess above is right, then the setFixedCostOfVehicle wouldn't get used at all. Right?
Beta Was this translation helpful? Give feedback.
All reactions