Login

Robust transportation network design under user equilibrium

Show full item record




Title: Robust transportation network design under user equilibrium
Author: Lu, Yun
Other Contributors: Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Advisor: Dimitris J. Bertsimas and Georgia Perakis.
Department: Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Publisher: Massachusetts Institute of Technology
Issue Date: 2007
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).
URI: http://hdl.handle.net/1721.1/41731
Keywords: Computation for Design and Optimization Program.

Files in this item

Files Size Format View Description
Preview, non-printable (open to all) 2.573Mb PDF View/Open Preview, non-printable (open to all)
Full printable version (MIT only) 2.573Mb PDF View/Open Full printable version (MIT only)

This item appears in the following Collection(s)

Show full item record

Search DSpace@MIT


Advanced Search

Browse

My Account

Links