How to code Branch-and-Cut to solve the VRP problem? With the existing model and algorithm.

回答済み

Xiaoyang Wei

• 2019年05月09日 01:19

How to code Branch-and-Cut to solve the VRP problem? With the existing model and algorithm.

0

• 正式なコメント

  

  Simranjit Kaur

  Gurobi Staff

  • 2024年12月06日 00:59

  This post is more than three years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum. Or why not try our AI Gurobot?.
• 

  Sonja Mars

  Gurobi Staff

  • 2019年08月02日 07:59

  Hi,

  Sorry, I don't understand what you are looking for. What exactly do you want to do? Do you want to use Gurobi solve a VRP or do you want to write a Branch-and-Cut algorithm yourself?

  Best regards,

   Sonja

  0
• 

  Hung-chih Yang

  • 2022年12月29日 23:34

  Hi, I think the original ask was asking for a generic VRP solution, as Gurobi already has an TSP example. VRP, like TSP, can be more efficient using a call-back function to rid of sub-solutions, i.e., row generation, or branch-and-cut. In short, it would be great if Gurobi can provide a VRP example, like the TSP example.

  0

投稿コメントは受け付けていません。