Originally posted by: snpny
Hello,
Im dealing with integer programming formulation for Vehicle Routing Problem. And I need to have a distance matrix data between all the nodes in the graph that I focus on. I have 357 nodes in my graph in which there is an edge between some of as I attached in the attachment. But, there is no connection between all nodes, so I need to assign a big M for those who have not an edge between.
Can anyone help me to build a 357x357 matrix considering the real values for those who have an edge, and a big M for the rest?
Or Im open for any suggestion as routing constraint that can add to my formulation.
#CPLEXOptimizers#DecisionOptimization