Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/147171 
Autor:innen: 
Erscheinungsjahr: 
2013
Quellenangabe: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 9 [Publisher:] Springer [Place:] Heidelberg [Year:] 2013 [Pages:] 1-9
Verlag: 
Springer, Heidelberg
Zusammenfassung: 
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.
Schlagwörter: 
Employee transportation
Set partitioning
Knapsack problem
Sweep algorithm
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article

Datei(en):
Datei
Größe
664.91 kB





Publikationen in EconStor sind urheberrechtlich geschützt.