An employee transporting problem

Journal of Industrial Engineering International

دوره 9، شماره 1، اسفند 2013   

نویسنده

Ümit Yüceer

Department of Industrial Engineering, Toros University, Mersin 33140, Turkey

چکیده

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.

کلیدواژه‌ها

Employee transportation؛ Set partitioning؛ Knapsack problem؛ Sweep algorithm