Please use this identifier to cite or link to this item:
Yüceer, Ümit
Year of Publication: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 9 [Year:] 2013 [Pages:] 1-9
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
Persistent Identifier of the first edition: 
Creative Commons License:
Document Type: 

Files in This Item:
664.91 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.