Piecewise truckload network procurement

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.

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

2011

Author dc:creator

• Huang, Jefferson

Advisor dc:contributor.advisor

• Chris Caplice.

• Civil and Environmental Engineering.

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/70766

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/70766