RomainM
RomainM
I don't have any code at hand unfortunately ! I currently only have access to CPLEX 20.1 and its examples [here](https://www.ibm.com/docs/en/icos/20.1.0?topic=cplex-python-examples), but I am not sure how this would translate...
I don't have any code, but just noticed (in the [docs](https://coin-or.github.io/pulp/technical/solvers.html)) the `callback` argument does not exist anymore ?
If z=0, you can use the `fixed_cost` argument : https://vrpy.readthedocs.io/en/latest/vrp_variants.html#fixed-costs.
Unfortunately this is not possible generically. But you can obtain an approximation by computing the cost once you have the routes.
Yes, this is equivalent to using the `fixed_cost` argument. In fact this is exactly what is done : https://github.com/Kuifje02/vrpy/blob/fb9adea8d8f89f07e7074c4de3c56d7f05007243/vrpy/vrp.py#L929-L933
Hi, For issue 1, I suggest you use the maximum duration parameter. You can either convert the distance limit to a time limit, or set the time matrix to the...
Nice ! The general idea would be to have this paramater as a list, as explained in the docs [here](https://vrpy.readthedocs.io/en/latest/vrp_variants.html#cvrp-with-heterogeneous-fleet-hfcvrp).
The main idea is to replace the parameter by a list (instead of an integer), just like it is done for the `load_capacity` parameter : `prob = VehicleRoutingProblem(G, mixed_fleet=True, load_capacity=[10,...
Pulp Exception: problem Not Solved & heuristic_only returns different solution than shown in preview
Hi there ! Thanks for you feedback ! Could you share your data so that we can try tro replicate the error ?