Solving some variants of vehicle routing problem with Branch-and-cut and Column generation algorithms

Abdullahi Ibrahim, Department of Mathematical Sciences, Baze University, Abuja, Nigeria, Jeremiah Ishaya, Rabiat Abdulaziz, Sowole Samuel, Department of Mathematical Science, African Institute for Mathematical Science, Senegal, Department of Energy Engineering, Pan African University of Water and Energy Resources, University of Tlemcen, Algeria, Department of Mathematical Science, African Institute for Mathematical Science, Senegal
2020 Open Journal of Mathematical Sciences  
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.
doi:10.30538/oms2020.0095 fatcat:2nho6sqb2fdytmwmy2ig7vkn6u