obtained near-optimal solutions. In the present study, a gradient-descent algorithm was devised to solve the TNDP after … proposed gradient-based algorithm outperformed “state-of-the-art” metaheuristics in both accuracy and efficiency …

proposed model can be solved efficiently with a branch-and-cut algorithm available in most commercial MIP solvers. Our model is …

solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the … knapsack solution. It requires testing and matching too many alternatives to obtain a partition. The sweep algorithm is …