Hi,
I would be glad if you show or share a sample of CP_VRPSPDTW_Docplex_Python or similar ones.
NumberCustomers = 10
Capacity = 200
Customers = [i for i in range(1, NumberCustomers + 1)]
CustomersDepot = [0] + Customers + [NumberCustomers + 1] ##index 0 and 11 are depot
Vehicles = [i for i in range(1, 4)] #NV
ReadyTime=[0,74,151,116,42,65,42,90,167,95,180,0]
DueTime = [240,104,181,146,72,95,72,120,197,125,210,240]
ser=[0,10,10,10,10,10,10,10,10,10,10,0] # Service Time
PDemand=[0,10,40,10,20,23,16,23,3,25,26,0] # Pick up
DDemand=[0,10,10,30,19,14,9,13,13,23,3,0] # Delivery
Already I Solved this problem by Cplex solver in python and this time I want to solve by constraint programming in python!
Best regards,
------------------------------
milad faramarzzadeh
------------------------------
#DecisionOptimization