2026-09-19T10:43:32Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/285052026-06-06T01:03:48Zcom_1721.1_7582com_1721.1_7581com_1721.1_101402col_1721.1_131023col_1721.1_101610
Jarrod Goentzel.
Akkas, Arzum, 1978-
Massachusetts Institute of Technology. Engineering Systems Division.
Massachusetts Institute of Technology. Engineering Systems Division
2005-09-26T20:53:09Z
2005-09-26T20:53:09Z
2004
2004
http://hdl.handle.net/1721.1/28505
57317154
Thesis (M. Eng. in Logistics)--Massachusetts Institute of Technology, Engineering Systems Division, 2004.
Includes bibliographical references (leaves 87-88).
The objective of this thesis is to find an appropriate analytical method for scheduling the daily driver tasks in the grocery industry. The goal is to maximize driver utilization. A "Bin-packing" approach is employed to solve the problem. A Bin-packing problem concerns packing a list of items into the minimal number of unit capacity bins. In our problem, the drivers correspond to the bins and the daily delivery tasks are equivalent to the items, where we use time units to measure bin capacity. The model is applied to characterize the operation of a grocery company. Several bin-packing algorithms are implemented on two weeks of delivery data, which represent the company's transportation demand. The driver requirements are calculated and compared with their actual assets. Driver requirements are assessed on a per-day basis, considering the volatility in transportation demand over the course of the week. The performance of a given bin-packing algorithm is measured by how well it maximizes driver utilization and balances the workload among the drivers. The model's solution generated labor savings and proved that better resource allocation is possible by considering the demands of the various dispatching locations and the days of the week. Extension of the current model to capture the time window constraints of the delivery locations is proposed for future further research.
by Arzum Akkas.
M.Eng. in Logistics
88 leaves
5592834 bytes
5602512 bytes
application/pdf
application/pdf
en_US
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Engineering Systems Division.
Transportation resource scheduling in food retail industry
Transportation resource scheduling in grocery industry
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="8d6d172d-47ed-4394-847c-af6be9c5b73e">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>en_US</Language>
<Title>Transportation resource scheduling in food retail industry</Title>
<Subtitle>Transportation resource scheduling in grocery industry</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Akkas, Arzum, 1978-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Engineering Systems Division.</Keyword>
<Abstract>The objective of this thesis is to find an appropriate analytical method for scheduling the daily driver tasks in the grocery industry. The goal is to maximize driver utilization. A "Bin-packing" approach is employed to solve the problem. A Bin-packing problem concerns packing a list of items into the minimal number of unit capacity bins. In our problem, the drivers correspond to the bins and the daily delivery tasks are equivalent to the items, where we use time units to measure bin capacity. The model is applied to characterize the operation of a grocery company. Several bin-packing algorithms are implemented on two weeks of delivery data, which represent the company's transportation demand. The driver requirements are calculated and compared with their actual assets. Driver requirements are assessed on a per-day basis, considering the volatility in transportation demand over the course of the week. The performance of a given bin-packing algorithm is measured by how well it maximizes driver utilization and balances the workload among the drivers. The model's solution generated labor savings and proved that better resource allocation is possible by considering the demands of the various dispatching locations and the days of the week. Extension of the current model to capture the time window constraints of the delivery locations is proposed for future further research.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>