Robust transportation network design under user equilibrium
Name
225081359-MIT.pdf
Description
Full printable version
Size
2.45 MB
Format
Adobe PDF
Checksum (MD5)
0783fa6234d0fad3d863e1151b551442
Author(s)
Lu, Yun
Advisor(s)
Dimitris J. Bertsimas and Georgia Perakis.
Date Issued
2007
Publisher
Massachusetts Institute of Technology
Abstract
We address the problem of designing a transportation network in the presence of demand uncertainty, multiple origin-destination pairs and a budget constraint for the overall construction cost, under the behavioral assumption that travelers optimize their own travel costs (i.e., the "user-equilibrium" condition). Under deterministic demand, we propose an exact integer optimization approach that leads to a quadratic objective, linear constraints optimization problem. As a result, the problem is efficiently solvable via commercial software, when the costs are linear functions of traffic flows. We then use an iterative algorithm to address the case of nonlinear cost functions. While the problem is intractable under probabilistic assumptions on demand uncertainty, we extend the previous model and propose an iterative algorithm using a robust optimization approach that models demand uncertainty. We finally report extensive numerical results to illustrate that our approach leads to tractable solutions for large scale networks.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2007.
Includes bibliographical references (p. 59-63).
Subjects
Computation for Design and Optimization Program.
MIT Department
Massachusetts Institute of Technology. Computation for Design and Optimization Program
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.
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.
Persistent DSpace Link
