2026-09-19T08:51:39Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/429262022-01-13T07:54:48Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Patrick Jaillet.
Limpaitoon, Tanachai
Massachusetts Institute of Technology. Operations Research Center.
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
2008-11-07T14:11:00Z
2008-11-07T14:11:00Z
2008
2008
http://hdl.handle.net/1721.1/42926
248705840
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering; and, (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2008.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 99-102).
In this thesis we consider a multi-period truckload pick-up and delivery problem dealing with real-time requests over a finite time horizon. We introduce the notion of postponement of requests, whereby the company can postpone some requests to the next day in order to improve its operational efficiency. The postponed requests must then be served on the next day. The daily costs of operation include costs associated with the trucks' empty travel distances and costs associated with postponement. The revenues are directly proportional to the length of job requests. We evaluate the profits of various re-optimization policies with the possibility of postponement. Another important notion of trucking operation corresponds to repositioning strategies which exploit probabilistic knowledge about future demands. A new repositioning strategy is proposed here to provide better decisions. For both notions, extensive computational results are provided under a general simulation framework.
by Tanachai Limpaitoon.
S.M.
102 p.
eng
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
Civil and Environmental Engineering.
Operations Research Center.
Real-time Multi-period truckload routing problems
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="72a8bdb7-b857-40b8-9b85-643a3285fa30">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Real-time Multi-period truckload routing problems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2008</PublicationDate>
<Authors>
<Author>
<DisplayName>Limpaitoon, Tanachai</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>Civil and Environmental Engineering.</Keyword>
<Keyword>Operations Research Center.</Keyword>
<Abstract>In this thesis we consider a multi-period truckload pick-up and delivery problem dealing with real-time requests over a finite time horizon. We introduce the notion of postponement of requests, whereby the company can postpone some requests to the next day in order to improve its operational efficiency. The postponed requests must then be served on the next day. The daily costs of operation include costs associated with the trucks' empty travel distances and costs associated with postponement. The revenues are directly proportional to the length of job requests. We evaluate the profits of various re-optimization policies with the possibility of postponement. Another important notion of trucking operation corresponds to repositioning strategies which exploit probabilistic knowledge about future demands. A new repositioning strategy is proposed here to provide better decisions. For both notions, extensive computational results are provided under a general simulation framework.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>