Answers are grounded in this paper and cite their sources.
In this research work, we applied some solving techniques on Travelling salesman problem (TSP) and Capaciated Vehicle routing problem (CVRP) which are some of the variants of vehicle routing problem. For each of the considered problem, Branch-and-cut was applied on TSP and Column generation technique was used on CVRP. We obtained optimal solution and tour. Hence, these methods can be used to solve similar problem for optimal solution.
No takes yet. Share an insight, caveat, or question.
İbrahim et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: