-
Notifications
You must be signed in to change notification settings - Fork 6
Description
Dear Authors,
I hope you are doing well.
I have been reviewing the code associated with your paper “A branch-and-cut algorithm for vehicle routing problems with
three-dimensional loading constraints”, and I had a question regarding the implementation of the packing heuristic.
In the file LoadingChecker.cpp, the function RunLoadingHeuristic currently contains only:
// Implement heuristic here.
return LoadingStatus::Invalid;
Since the paper mentions the use of a packing heuristic, I was wondering whether this part is implemented elsewhere in the code or if it was omitted from the released version.
Additionally, as the goal is to check packing feasibility rather than to fully optimize the CP model, it seems that using
set_stop_after_first_solution(true)
could be sufficient and might significantly reduce the computational time.
Could you please let me know whether an updated version of the code is available, or if a clarification or correction to the paper is needed?
Thank you very much for your time and for making your work available.
Best regards,
Igor Junqueira