Abstract: Vehicle Routing Problem (VRP) is one of the combinatoric problems that is difficult to solve, so it is incorporated into an NP-hard problem. VRP aims to produce a set of shortest routes from ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results