Artikel

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.

Language
Englisch

Bibliographic citation
Journal: Journal of Industrial Engineering International ; ISSN: 2251-712X ; Volume: 9 ; Year: 2013 ; Pages: 1-9 ; Heidelberg: Springer

Classification
Management
Subject
Employee transportation
Set partitioning
Knapsack problem
Sweep algorithm

Event
Geistige Schöpfung
(who)
Yüceer, Ümit
Event
Veröffentlichung
(who)
Springer
(where)
Heidelberg
(when)
2013

DOI
doi:10.1186/2251-712X-9-31
Handle
Last update
10.03.2025, 11:44 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Artikel

Associated

  • Yüceer, Ümit
  • Springer

Time of origin

  • 2013

Other Objects (12)