Because they did not show they used any methodological approach that we don't know for the past 30 years.
And according to the PR they did not use gurobi (or any sota mip solver), just their in-house lp solver in combination with shortest path algorithms and the fix-and-optimize heuristic.
Likely your particular use case will not fit their model anyway (for example you may want to consider contracts of affreighent along with leasing entire vessels).
So yes, or scientist and gurobi will definitely win.
How do you come to this conclusion? They way I read it rather sounds like they use the CP-SAT solver with LNS and LS workers, parallelized over multiple machines
Strong agree. I did a bunch of work on capacitated vehicle routing problems - basically the same as this +/- some bespoke constraints for shipping context maybe.
I benchmarked OR-Tools extensively vs e.g. LKH3 + my own hand-written solvers ... it's not a remotely credible library for these things, last time I checked. So ... don't have a lot of faith in Google's offerings here.
Aka give me one OR guy and a gurobi license and we will beat their result.
Bonus at the end of the excercise you will have an or guy that can help you solve other use cases as well.