An employee transporting problem

An employee transporting problem is described and a set partitioning model is developed. an investigation of the model leads to a knapsack problem as a surrogate problem. finding a partition corresponding to the knapsack problem provides a 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 implemented in obtaining a partition (subset-vehicle combination) in an efficient manner. illustrations are provided to show how the algorithms obtain solutions.