Ellis.L. Johnson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ellis.L. Johnson has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Earl Barnes
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
3 shared publications Adan E. Vela
School of Mechanical Engineering, Georgia Institute of Technology, Atlanta , GA, USA
1 shared publication- Andreea Popescu
Turner Broadcasting System, Inc., Atlanta, Georgia 30318
1 shared publication - Balaji Gopalakrishnan
SAS Institute Inc
1 shared publication - Balaji Gopalakrishnan
University of Minnesota
1 shared publication - Balaji Gopalakrishnan
School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA
1 shared publication
Latest Publications
- 1 May 2013
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 47 (2) , 198-213
Bid Prices When Demand Is a Mix of Individual and Batch Bookings
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.
- 1 May 2013
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 47 (2) , 198-213
Bid Prices When Demand Is a Mix of Individual and Batch Bookings
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.
- 9 March 2011
- Published by Springer Nature in Annals of Operations Research
- Vol. 186 (1) , 119-140
A least-squares minimum-cost network flow algorithm
- 9 March 2011
- Published by Springer Nature in Annals of Operations Research
- Vol. 186 (1) , 119-140
A least-squares minimum-cost network flow algorithm
- 8 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 11 (4) , 826-837
Near Real-Time Fuel-Optimal En Route Conflict Resolution
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%.
- 8 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 11 (4) , 826-837
Near Real-Time Fuel-Optimal En Route Conflict Resolution
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%.
- 9 January 2007
- Published by Springer Nature in Annals of Operations Research
- Vol. 149 (1) , 121-135
My experiences as a student and researcher in OR during the 1960’s and 70’s
- 9 January 2007
- Published by Springer Nature in Annals of Operations Research
- Vol. 149 (1) , 121-135
My experiences as a student and researcher in OR during the 1960’s and 70’s
- 1 June 2006
- Published by Springer Nature in Journal of Scheduling
- Vol. 9 (3) , 203-221
Operational airline reserve crew planning
- 1 June 2006
- Published by Springer Nature in Journal of Scheduling
- Vol. 9 (3) , 203-221
Operational airline reserve crew planning
- 1 November 2005
- Published by Springer Nature in Annals of Operations Research
- Vol. 140 (1) , 305-337
Airline Crew Scheduling: State-of-the-Art
- 1 November 2005
- Published by Springer Nature in Annals of Operations Research
- Vol. 140 (1) , 305-337
Airline Crew Scheduling: State-of-the-Art
- 1 November 2005
- Published by Springer Nature in Annals of Operations Research
- Vol. 140 (1) , 263-304
Logical Processing for Integer Programming
- 1 November 2005
- Published by Springer Nature in Annals of Operations Research
- Vol. 140 (1) , 263-304
Logical Processing for Integer Programming
- 31 October 2002
- Published by Elsevier in Operations Research Letters
- Vol. 30 (5) , 289-294
A least-squares primal-dual algorithm for solving linear programming problems
- 31 October 2002
- Published by Elsevier in Operations Research Letters
- Vol. 30 (5) , 289-294
A least-squares primal-dual algorithm for solving linear programming problems