Learn More
The most common approach for modeling and solving routing and scheduling problems in a dynamic setting is to solve, as close to optimal as possible, a series of deterministic, myopic models. The argument is most often made that, if the data changes, then we should simply reoptimize. We use the setting of the load matching problem that arises in truckload(More)
Online models for real-time operations planning face a host of implementation issues that do not arise in more strategic arenas. We use the seemingly simple problem of assigning drivers to loads in the truckload motor carrier industry as an instance to study the issues that arise in the process of implementing a real-time dispatch system. Although the(More)
We address the problem of combining a cost-based simulation model, which makes decisions over time by minimizing a cost model, and rule-based policies, where a knowledgeable user would like certain types of decisions to happen with a specified frequency when averaged over the entire simulation. These rules are designed to capture issues that are difficult(More)
A major challenge in the formulation of optimization models for large-scale, complex operational problems is that some data are impossible or uneconomical to collect, producing a cost model that suffers from incomplete information. As a result, even an optimal solution may be " wrong " in the sense that it is solving the wrong problem. In many operational(More)
We look at the problem of optimizing complex operations with incomplete information where the missing information is revealed indirectly and imperfectly through historical decisions. Incomplete information is characterized by missing data elements governing operational behavior and unknown cost parameters. We assume some of this information may be(More)
  • 1