Abstract: In this paper, we propose to solve the max-min multiple knapsack problem by using an exact solution search. An instance of the problem is defined by a set of n items to be packed into m ...

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 ...