VRP is a NP-hard problem and hence the computational time increases polynomially ... Travelling time from one node to another is directly proportional to the linear distance between those two nodes.

LPFramework is an abstraction to programmatically formulate mixed-integer linear optimization (MILP) problems, which can then be solved using open-source/commercial ...