EBEarl Barnes

Earl Barnes

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Earl Barnes has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Bid Prices When Demand Is a Mix of Individual and Batch Bookings

    by Andreea Popescu, Earl Barnes, Ellis Johnson, Pinar Keskinocak

    Industries such as aviation, hospitality, and package tours often face both individual and batch bookings, requiring one unit and multiple units of capacity, respectively. Using bid prices is a common practice in accepting or rejecting an incoming booking (or equivalently, deciding which price bucket to offer to the incoming bookings at a given time). Most of the literature and existing applications for making accept/reject decisions model the arrival stream as individual bookings. In this paper, we propose an effective approach to determine bid prices when there is a mixed demand pattern with individual and batch bookings. We propose decomposing the demand into “small” and “large” bookings, using dynamic programming for large bookings, and a fast, high-quality approximation for small bookings. We present an application of our approach in the air cargo industry, where cargo is often separated into two categories, namely, mail and packages (small cargo) and freight (large cargo). To obtain bid prices for small cargo, we approximate cargo booking requests with passenger arrival models and develop an efficient and effective algorithm to solve the probabilistic nonlinear formulation of the seat allocation problem from the passenger literature. To obtain bid prices for large cargo, we solve a dynamic program decomposed by flight leg, which is tractable due to the scattered arrivals and large sizes of the bookings. Our approach leads to a significant potential increase in revenues compared to the first-come, first-served (FCFS) approach and the solution from the deterministic formulation (DIP), two methods commonly used in practice.


  • Near Real-Time Fuel-Optimal En Route Conflict Resolution

    by Adan E. Vela, Senay Solak, John-Paul B. Clarke, William E. Singhose, Earl R. Barnes, Ellis L. Johnson

    In this paper, we consider the air-traffic conflict-resolution problem and develop an optimization model to identify the required heading and speed changes of aircraft to avoid conflict such that fuel costs are minimized. Nonconvex fuel functions in the optimization problem are modeled through tight linear approximations, which enable the formulation of the problem as a mixed-integer linear program. The significance of the developed model is that fuel-optimal conflict-resolution maneuvers can be identified in near real time, even for conflicts involving a large number of aircraft. Computational tests based on realistic air-traffic scenarios demonstrate that conflicts involving up to 15 aircraft can be solved in less than 10 s with an optimality gap of around 0.02%.


  • A least-squares primal-dual algorithm for solving linear programming problems

    by Earl Barnes, Victoria Chen, Balaji Gopalakrishnan, Ellis.L. Johnson