An employee transporting problem
محورهای موضوعی : Mathematical Optimization
1 - Department of Industrial Engineering, Toros University, Mersin 33140, Turkey
کلید واژه: Sweep Algorithm, Employee transportation, Set partitioning, Knapsack 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.
