2026-09-20T12:26:51Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/417272022-01-13T07:54:53Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
David Simchi-Levi.
Wang, Qian
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Massachusetts Institute of Technology. Computation for Design and Optimization Program
2008-05-19T16:12:34Z
2008-05-19T16:12:34Z
2007
2007
http://hdl.handle.net/1721.1/41727
225074800
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2007.
Includes bibliographical references (p. 67-68).
Transportation procurement is one of the most critical sourcing decisions to be made in many companies. This thesis addresses a real-life industrial problem of creating package bids for a company's transportation procurement auction. The purpose of offering package bids is to increase the carriers' capacity and to improve the reliability of services. In this thesis, we investigate the possibility of forming packages using the company's own distribution network. Effective distribution of packages requires balanced cycles. A balanced cycle is a cycle containing no more than 3 nodes with equal loads (or volume of package) on every link in the cycle. We develop mixed-integer programs to find the maximum amount of network volume that can be covered by well-balanced cycles. These models are deterministic models that provide a rough guide on the optimal way of package formation when loads are known in advance. Since demand is random in real life, we perform a stochastic analysis of the problem using various techniques including simulation, probabilistic analysis and stochastic programming. Results from the stochastic analysis show that the effectiveness of package distribution depends on how we allocate the volumes on the lanes to create balanced cycles. If we always assign a fixed proportion of the lanes' volumes to the cycles, then it is only possible to have well-balanced cycles when the average volumes on the lanes are very large, validating the advantage of joint bids between several companies. However, if we assign a different proportion of the lanes' volumes to the cycles each time demand changes, then it is possible to create cycles that are balanced most of the time. An approximated solution method is provided to obtain a set of balanced cycles that can be bid out.
by Qian Wang.
S.M.
68 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
Computation for Design and Optimization Program.
Pre-bid network analysis for transportation procurement auction under stochastic demand
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="83fd4af7-1896-415e-81e1-89e55c1e8b62">
<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>Pre-bid network analysis for transportation procurement auction under stochastic demand</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2007</PublicationDate>
<Authors>
<Author>
<DisplayName>Wang, Qian</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>Computation for Design and Optimization Program.</Keyword>
<Abstract>Transportation procurement is one of the most critical sourcing decisions to be made in many companies. This thesis addresses a real-life industrial problem of creating package bids for a company's transportation procurement auction. The purpose of offering package bids is to increase the carriers' capacity and to improve the reliability of services. In this thesis, we investigate the possibility of forming packages using the company's own distribution network. Effective distribution of packages requires balanced cycles. A balanced cycle is a cycle containing no more than 3 nodes with equal loads (or volume of package) on every link in the cycle. We develop mixed-integer programs to find the maximum amount of network volume that can be covered by well-balanced cycles. These models are deterministic models that provide a rough guide on the optimal way of package formation when loads are known in advance. Since demand is random in real life, we perform a stochastic analysis of the problem using various techniques including simulation, probabilistic analysis and stochastic programming. Results from the stochastic analysis show that the effectiveness of package distribution depends on how we allocate the volumes on the lanes to create balanced cycles. If we always assign a fixed proportion of the lanes' volumes to the cycles, then it is only possible to have well-balanced cycles when the average volumes on the lanes are very large, validating the advantage of joint bids between several companies. However, if we assign a different proportion of the lanes' volumes to the cycles each time demand changes, then it is possible to create cycles that are balanced most of the time. An approximated solution method is provided to obtain a set of balanced cycles that can be bid out.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>