Research effort has been given to find the optimal location and initial settings of Thyristor-Controlled Series Capacitor (TCSC) using Mixed-Integer Linear Programming (MILP). As a useful tool for combinatorial optimisation over integer and continuous variables, mixed-integer programming approach can provides robust performance as well as high computation efficiency when solving complex optimal...

There is a great incentive for developing systematic approaches that effectively identify strategies for planning oilfield complexes. This paper proposes an MILP that relies on a reformulation of the model developed by Tsarbopoulou (UCL M.S. Dissertation, London, 2000). Moreover, a bilevel decomposition technique is applied to the MILP. A master problem determines the assignment of platforms to...

In this study, we aimed to assess the solution quality for location-allocation problems from facilities generated by the software TransCAD®, a Geographic Information System for Transportation (GIS-T). Such facilities were obtained after using two routines together: Facility Location and Transportation Problem, when compared with optimal solutions from exact mathematical models, based on Mixed I...

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 alternatio...

A large mixed-integer linear program (MILP) and a much smaller nonlinear programming (NLP) approximation of the MILP, involving simulation and response surface estimation via regression analysis, are proposed to solve the problem of the optimal selection of natural gas supply contracts by local gas distribution utilities. Each potential supply source is characterized by several price and nonpri...

In some cases, we may be able to find “efficient” exact algorithms to solve a COP: for example, the problem of finding the shortest paths on a graph, under some reasonable assumptions often met in practise, can be solved by the Dijkstra or Bellman-Ford algorithms, able to provide optimal solutions in running times according to a polynomial function (of small degree). For more complex problems, ...

This paper presents a novel operational scheme for enhanced utilization of late-life shale multi-well systems. These systems are characterized by a large number of geographically spread wells and pads, where a substantial number of the wells are producing at low erratic rates due to reservoir pressure depletion and well liquid loading. By applying a cyclic shut-in and production strategy, the s...

Many efforts are recently being dedicated to developing models that seek to provide insights into the techno-economic benefits of battery storage coupled to photovoltaic (PV) generation system. However, not all models consider the operation of the PV – battery storage system with a feed-in tariff (FiT) incentive, different electricity rates and battery storage unit cost. An electricity customer...

Defender-Attacker Stackelberg games are the foundations of tools deployed for computing optimal patrolling strategies in adversarial domains such as the United states Federal Air Marshals Service and the United States Coast Guard, among others. In Stackelberg game models of these systems the attacker knows only the probability that each target is covered by the defender, but is oblivious to the...

We address the problem of short-term scheduling of parallel batch reactors followed by continuously operating finishing trains to form work groups which is motivated by a real world problem at the Dow Chemical Company. The proposed MILP formulation is based on the recent planning model of ErdirikDogan and Grossmann (2007), and features additional constraints for handling complex arrangements ar...