LBLogan D. R. Beal

Logan D. R. Beal

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Logan D. R. Beal has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    GEKKO Optimization Suite

    by Logan D. R. Beal, Daniel C. Hill, R. Abraham Martin, John D. Hedengren

    This paper introduces GEKKO as an optimization suite for Python. GEKKO specializes in dynamic optimization problems for mixed-integer, nonlinear, and differential algebraic equations (DAE) problems. By blending the approaches of typical algebraic modeling languages (AML) and optimal control packages, GEKKO greatly facilitates the development and application of tools such as nonlinear model predicative control (NMPC), real-time optimization (RTO), moving horizon estimation (MHE), and dynamic simulation. GEKKO is an object-oriented Python library that offers model construction, analysis tools, and visualization of simulation and optimization. In a single package, GEKKO provides model reduction, an object-oriented library for data reconciliation/model predictive control, and integrated problem construction/solution/visualization. This paper introduces the GEKKO Optimization Suite, presents GEKKO’s approach and unique place among AMLs and optimal control packages, and cites several examples of problems that are enabled by the GEKKO library.


  • Integrated scheduling and control in discrete-time with dynamic parameters and constraints

    by Logan D.R. Beal, Damon Petersen, David Grimsman, Sean Warnick, John D. Hedengren


  • Open Access

    Special Issue: Combined Scheduling and Control

    by John Hedengren, Logan Beal

    This Special Issue (SI) of Processes, “Combined Scheduling and Control,” includes approaches to formulating combined objective functions, multi-scale approaches to integration, mixed discrete and continuous formulations, estimation of uncertain control and scheduling states, mixed integer and nonlinear programming advances, benchmark development, comparison of centralized and decentralized methods, and software that facilitates the creation of new applications and long-term sustainment of benefits.


  • Open Access

    Economic Benefit from Progressive Integration of Scheduling and Control for Continuous Chemical Processes

    by Logan D. R. Beal, Damon Petersen, Guilherme Pila, Brady Davis, Sean Warnick, John D. Hedengren

    Performance of integrated production scheduling and advanced process control with disturbances is summarized and reviewed with four progressive stages of scheduling and control integration and responsiveness to disturbances: open-loop segregated scheduling and control, closed-loop segregated scheduling and control, open-loop scheduling with consideration of process dynamics, and closed-loop integrated scheduling and control responsive to process disturbances and market fluctuations. Progressive economic benefit from dynamic rescheduling and integrating scheduling and control is shown on a continuously stirred tank reactor (CSTR) benchmark application in closed-loop simulations over 24 h. A fixed horizon integrated scheduling and control formulation for multi-product, continuous chemical processes is utilized, in which nonlinear model predictive control (NMPC) and continuous-time scheduling are combined.


  • Open Access

    Combined Noncyclic Scheduling and Advanced Control for Continuous Chemical Processes

    by Damon Petersen, Logan D. R. Beal, Derek Prestwich, Sean Warnick, John D. Hedengren

    A novel formulation for combined scheduling and control of multi-product, continuous chemical processes is introduced in which nonlinear model predictive control (NMPC) and noncyclic continuous-time scheduling are efficiently combined. A decomposition into nonlinear programming (NLP) dynamic optimization problems and mixed-integer linear programming (MILP) problems, without iterative alternation, allows for computationally light solution. An iterative method is introduced to determine the number of production slots for a noncyclic schedule during a prediction horizon. A filter method is introduced to reduce the number of MILP problems required. The formulation’s closed-loop performance with both process disturbances and updated market conditions is demonstrated through multiple scenarios on a benchmark continuously stirred tank reactor (CSTR) application with fluctuations in market demand and price for multiple products. Economic performance surpasses cyclic scheduling in all scenarios presented. Computational performance is sufficiently light to enable online operation in a dual-loop feedback structure.


  • Combined model predictive control and scheduling with dominant time constant compensation

    by Logan D.R. Beal, Junho Park, Damon Petersen, Sean Warnick, John D. Hedengren