Large-scale linear programs are at the core of many traffic-related optimization problems in both planning and prediction. Moreover, many of these involve significant uncertainty, and hence are modeled using either chance constraints, or robust optimization. Chance constraints and robust optimization are by now classical approaches for dealing with uncertainty. The ultimate goal in each of these areas, is to find an explicit convex reformulation that provides some approximation to the original (uncertain) optimization problem. The work in these areas has helped us obtain a nearly comprehensive understanding of when convex reformulations (and approximations) are possible, and what the quality of the approximation is. Yet little has been said about truly tractable solutions—solutions where running time for the uncertain problem is comparable (perhaps even less than!) the time to solve the problem without any uncertainty. As networks grow in size, and our ability to capture more data rapidly increases, it is of paramount importance to rethink our theory of robust and uncertain optimization for transportation applications, to one that is computationally oriented..
Quickly deploying relief items is key to reducing a population’s burden in case of sudden onset disasters. Emergency response organizations, such as...
As new sources of traffic and related data are becoming more widely available and at a granularity that was inconceivable only a decade ago, the abili...
Links with this icon indicate that you are leaving a Bureau of Transportation
Statistics (BTS)/National Transportation Library (NTL)
Web-based service.
Thank you for visiting.
You are about to access a non-government link outside of
the U.S. Department of Transportation's National
Transportation Library.
Please note: While links to Web sites outside of DOT are
offered for your convenience, when you exit DOT Web sites,
Federal privacy policy and Section 508 of the Rehabilitation
Act (accessibility requirements) no longer apply. In
addition, DOT does not attest to the accuracy, relevance,
timeliness or completeness of information provided by linked
sites. Linking to a Web site does not constitute an
endorsement by DOT of the sponsors of the site or the
products presented on the site. For more information, please
view DOT's Web site linking policy.
To get back to the page you were previously viewing, click
your Cancel button.