Massachusetts Institute of Technology
Multi-stop trucking : a study on cost and carrier acceptance
Abstract
dc:description.abstractMulti-stop truckload has been gaining importance in recent years as part of a shift away from Less-than-truckload freight. In our research, we sought to understand how the price and carrier behavior vary as the number of stops increases. Rational economic theory says that these shipments will be more expensive, and experience shows that in practice they also tend to get rejected more often. This thesis tested these two likely results together with other factors known for affecting price and rejection rates, such as lead time, clustering of the stops, etc. We used logistics regression to predict the acceptance ratio and ordinary least squares regression to model the price based on historical data. We found that there is an inherent cost associated with multi-stops, which depends on the number of stops and whether the stop is a pick or a drop. The proximity of these stops as well as the stop-off charge can also impact the price. Carrier acceptance and routing guide depth depends on the price structure and load characteristics. As the number of stops increases, it takes longer for a tender to be accepted and the shipment performance also deteriorates with an increased likelihood of late delivery especially if the initial pickup is late. Therefore, companies need to be aware of the hidden costs associated with multi-stop truckloads as they plan their transportation network.
Degree
thesis:*- Department dc:contributor.department
- Massachusetts Institute of Technology. Supply Chain Management Program.
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 2016
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Chen, Xiaojia (Xiaojia Amy)
- Tsai Yang, Shang Lin
- Advisor dc:contributor.advisor
-
- Chris Caplice.
Subjects
dc:subject × 2Rights
dc:rights- Statement dc:rights
-
- MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
- Licence dc:rights.uri
- Language dc:language.iso
- eng
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1721.1/107521
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/107521