Alexander S. Estes

Alexander S. Estes

Auto-generated profile, based on publicly available information

Alexander S. Estes

Robert H. Smith School of Business and Institute of Systems Research, University of Maryland, College Park, Maryland 20742

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2020 in Transportation Science
Verified
Journal Article
Closed access
MBMichael O. Ball
Michael O. Ball
AEAlexander S. Estes
Alexander S. Estes
MHMark Hansen
Mark Hansen
YLYulin Liu
Yulin Liu
In this paper, we define and investigate quantity-contingent auctions. Such auctions can be used when there exist multiple units of a single product and the value of a set of units depends on the total quantity sold. For example, a road network or airport will become congested as the number of users increase so that a permit for use becomes more valuable as the total number allocated decreases. A quantity-contingent auction determines both the number of items sold and an allocation of items to bidders. Because such auctions could be used by bidders to gain excessive market power, we impose constraints limiting market power. We focus on auctions that allocate airport arrival and departure slots. We propose a continuous model and an integer programming model for the associated winner determination problem. Using these models, we perform computational experiments that lend insights into the properties of the quantity-contingent auction.

1 July 2023 in INFORMS Journal on Optimization
Verified
Journal Article
Closed access
AEAlexander S. Estes
Alexander S. Estes
JRJean-Philippe P. Richard
Jean-Philippe P. Richard
We study two-stage linear programs with uncertainty in the right-hand side in which the uncertain parameters of the problem are correlated with a variable called the side information, which is observed before an action is made. We propose an approach in which a linear regression model is used to provide a point prediction for the uncertain parameters of the problem. We use an approach called smart predict-then-optimize. Rather than minimizing a typical loss function for regression, such as squared error, we approximately minimize the objective value of the resulting solutions to the optimization problem. We conduct computational tests that compare our method with other approaches for optimization problems with side information. The results indicate that our method can provide better objective values in situations where the true model is reasonably close to a linear model. Although the procedure we propose requires a longer time for fitting than existing methods, it requires less time to produce a decision for each given observation of the side information. Supplemental Material: The e-companion is available at https://doi.org/10.1287/ijoo.2023.0088 .

1 July 2020 in Transportation Science
Verified
Journal Article
Closed access
AEAlexander S. Estes
Alexander S. Estes
MBMichael O. Ball
Michael O. Ball
We study stochastic integer programming models for assigning delays to flights that are destined for an airport whose capacity has been impacted by poor weather or some other exogenous factor. In the existing literature, empirical evidence seemed to suggest that a proposed integer programming model had a strong formulation, but no existing theoretical results explained the observation. We apply recent results concerning the polyhedra of stochastic network flow problems to explain the strength of the existing model, and we propose a model whose size scales better with the number of flights in the problem and that preserves the strength of the existing model. Computational results are provided that demonstrate the benefits of the proposed model. Finally, we define a type of equity property that is satisfied by both models.

1 January 2017 in Transportation Research Record: Journal of the Transportation Research Board
Verified
Journal Article
Closed access
AEAlexander Estes
Alexander Estes
MBMichael Ball
Michael Ball
This paper provides a model-based approach to planning ground delay programs. Previous research on automated planning of ground delay programs has involved the use of mathematical programming techniques. This paper proposes a data-driven method that models the problem of choosing a traffic management initiative by using the framework of the multiarmed bandit decision problem. This approach makes greater use of the available data, and suggestions made by this procedure can be shown along with data that informed the decision. This combination of tools allows decision makers to more easily evaluate suggested decisions. The paper also provides simulations of the procedure on the basis of data from Newark (New Jersey) International Airport to evaluate its effectiveness.

13 August 2018 in EURO Journal on Transportation and Logistics
Verified
Journal Article
Open access
PDF file
AEAlexander Estes
Alexander Estes
DLDavid J. Lovell
David J. Lovell
MBMichael O. Ball
Michael O. Ball
We discuss a new approach to unsupervised learning and data exploration that involves summarizing a large data set using a small set of “representative” elements. These representatives may be presented to a user in order to provide intuition regarding the distribution of observations. Alternatively, these representatives can be used as cases for more detailed analysis. We call the problem of selecting the representatives the unsupervised prototype reduction problem. We discuss the KC-UPR method for this problem and compare it to other existing methods that may be applied to this problem. We propose a new type of distance measure that allows for more interpretable presentation of results from the KC-UPR method. We demonstrate how solutions from the unsupervised prototype reduction problem may be used to provide decision support for the planning of air traffic management initiatives, and we produce computational results that compare the effectiveness of several methods in this application. We also provide an example of how the KC-UPR method can be used for data exploration, using data from air traffic management initiatives at Newark Liberty International Airport.

1 January 2020 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
AEAlexander S. Estes
Alexander S. Estes
MBMichael O. Ball
Michael O. Ball
We study a type of network flow problem that we call the minimum-cost F-graph flow problem. This problem generalizes the typical minimum-cost network flow problem by allowing the underlying network to be a directed hypergraph rather than a directed graph. This new problem is pertinent because it can be used to model network flow problems that occur in a dynamic, stochastic environment. We formulate this problem as an integer program, and we study specifically the case where every node has at least one outgoing edge with no capacity constraint. We show that even with this restriction, the problem of finding an integral solution is NP-hard. However, we can show that all of the inequality constraints of our formulation are either facet-defining or redundant.