Real-time Multi-period truckload routing problems

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.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Civil and Environmental Engineering.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2008

Author dc:creator

• Limpaitoon, Tanachai

Advisor dc:contributor.advisor

• Patrick Jaillet.

• Civil and Environmental Engineering.
• Operations Research Center.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/42926

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/42926