MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Piecewise truckload network procurement

Author(s)
Huang, Jefferson
Thumbnail
DownloadFull printable version (6.895Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Civil and Environmental Engineering.
Advisor
Chris Caplice.
Terms of use
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
Metadata
Show full item record
Abstract
Faced with procuring transportation over its freight network, a shipper can either bid out all of its lanes at once, or somehow divide up the network and bid it out in pieces. For large shippers, practical concerns such as attendant manpower requirements and exposure to financial/operational risks can make the former undesirable or even infeasible. Such a shipper therefore needs to determine how to best allocate the lanes in its freight network to different bids to be run at different times. This thesis addresses this allocation problem. Two related approaches are presented. The first focuses on explicitly preserving the synergies that arise in truckload network operations while attempting to balance the sizes of each bid, and is framed as a graph partitioning problem. The second treats lanes as independent entities and frames network allocation as a bin-packing problem, with constraints that attempt to achieve both balance and, implicitly, synergy preservation. These two approaches are illustrated and evaluated using a small subnetwork consisting of lanes from a large shipper. While the graph partitioning approach works in theory, the as yet unresolved question of what constitutes a "correct" synergy definition for network partitioning purposes, and the practical significance of the constraints considered in the bin-packing approach, make this second approach more attractive. The development of a lane allocation model that can explicitly consider inter-lane synergies as well as the kinds of constraints addressed in the second approach is left for future work.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2011.
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (p. 107-110).
 
Date issued
2011
URI
http://hdl.handle.net/1721.1/70766
Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Publisher
Massachusetts Institute of Technology
Keywords
Civil and Environmental Engineering.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.