Skip to main content

New answers tagged

0 votes

Unable to find good solution for CVRP with Time Window

Hexaly can solve your CVRPTW problem optimally in minutes or even seconds. Hexaly relies on state-of-the-art Branch-Cut-Price techniques, such as those in VRPSolver, to deliver lower bounds and prove ...
Hexaly's user avatar
  • 2,986
0 votes

Unable to find good solution for CVRP with Time Window

It's hard to give a meaningful response without knowing more about the model. Two possibilities immediately come to mind. First, if you are using a "big M" type formulation, finding tighter (...
prubin's user avatar
  • 39.3k
1 vote

Unable to find good solution for CVRP with Time Window

I think it is important to note that even thought the gap is large (15%) the solution may still be very good, actually. My experience is that the linear programming bound obtained for most models of ...
Sune's user avatar
  • 6,552
4 votes
Accepted

Unable to find good solution for CVRP with Time Window

If you are fine with using an heuristic solver, that does not provide you gaps or bounds, you can use PyVRP. It employs the current state-of-the-art heuristic for the VRPTW (Hybrid Genetic Search). ...
PeterD's user avatar
  • 1,636
2 votes

How to achieve recording the change of objective or primal gap in solving MILP by SCIP?

SCIP is based on a plugin-architecture, see this video for an introduction. In your case you are interested in Event Handlers: While solving a constraint integer program, SCIP drops thousands of ...
sascha's user avatar
  • 527

Top 50 recent answers are included