Global optimization for power dispatch problems based on theory of moments

Non-convex of an optimal power dispatch problem makes it difficult to guarantee the global optimum. This paper presents a convex relaxation approach, called the Moment Semidefinite Programming (MSDP) method, to facilitate the search for deterministic global optimal solutions. The method employs a sequence of moments, which can linearize polynomial functions and construct positive semidefinite moment matrices, to form an SDP convex relaxation for power dispatch problems. In particular, the rank of the moment matrix is used as a sufficient condition to ensure the global optimality. The same condition can also be leveraged to estimate the number of global optimal solution(s). This method is effectively applied to {0,1}-economic dispatch (ED) problems and optimal power flow (OPF) problems. Simulation results showed that the MSDP method is capable of solving {0,1}-ED problems with integer values directly, and is able to identify if more than one global optimal solutions exist. In additional, the method can obtain rank-1 moment matrices for OPF’s counterexamples of existing SDP method, this ensures the global solution and overcomes the problem that existing SDP method cannot meet the rank-1 condition sometimes.     

Kariya (Hildegardia barteri) seed oil extraction: comparative evaluation of solvents,modeling, and optimization techniques

In this work, the effects of solid/solvent ratio (0.10–0.25?g/ml), extraction time (3–8?h), and solvent type (n-hexane, ethyl acetate, and acetone) together with their shared interactions on Kariya seed oil (KSO) yield were investigated. The oil extraction process was modeled via response surface methodology (RSM), artificial neural network (ANN) and adaptive neuro-fuzzy inference system (ANFIS) while the optimization of the three input variables essential to the oil extraction process was carried out by genetic algorithm (GA) and RSM methods. The low mean relative percent deviation (MRPD) of 0.94–4.69% and high coefficient of determination (R²) > 0.98 for the models developed demonstrate that they describe the solvent extraction process with high accuracy in this order: ANFIS, ANN, and RSM. The best operating condition (solid/solvent ratio of 0.1?g/ml, extraction time of 8?h, and acetone as solvent of extraction) that gave the highest KSO yield (32.52?wt.%) was obtained using GA-ANFIS and GA-ANN. Solvent extraction efficiency evaluation showed that ethyl acetate, n-hexane, and acetone gave maximum experimental oil yields of 19.20?±?0.28, 25.11?±?0.01, and 32.33?±?0.04?wt.%, respectively. Properties of the KSO varied based on the type of solvent used. The results of this work showed that KSO could function as raw material in both food and chemical industries.     

A new metaheuristic for optimization: Optics inspired optimization (OIO)

Due to the law of reflection, a concave reflecting surface/mirror causes the incident light rays to converge and a convex surface/mirror causes the light rays to reflect away so that they all appear to be diverging. These converging and diverging behaviors cause that the curved mirrors show different image types depending on the distance between the object and the mirror. We model such optical phenomena metaphorically into the searching process of numerical optimization by a new algorithm called optics inspired optimization (OIO). OIO treats the surface of the numerical function to be optimized as a reflecting surface in which each peak is assumed to reflect as a convex mirror and each valley to reflect as a concave one. Each individual is assumed to be an artificial object (or light point) that its artificially glittered ray is reflected back by the function surface, given that the surface is convex or concave, and the artificial image is formed (a candidate solution is generated within the search domain) based on the mirror equations adopted from physics of optics. Besides OIO, we introduce different variants of it, called ROIO (Rotation based OIO), and COIO (Convex combination based OIO) algorithms and conduct an extensive computational effort to find out the merit of the new algorithms. Our comparisons on benchmark test functions and a real world engineering design application (i.e., optimization of a centrifuge pump) demonstrate that the new algorithms are efficient and compete better than or similar to most of state of the art optimization algorithms with the advantage of accepting few input parameters.     

Optimal resilient power grid operation during the course of a progressing wildfire

We study a two-stage stochastic and nonlinear optimization model for operating a power grid exposed to a natural disaster. Although this approach can be generalized to any natural hazard of continuous (and not instantaneous) nature, our focus is on wildfires. We assume that an approaching wildfire impacts the power grid by reducing the transmission capacity of its overhead lines. At the time when proactive decisions have to be taken, the severity of the wildfire is not known. This introduces uncertainty. In this paper, we extend previous work by more realistically capturing this uncertainty and by strengthening the mathematical programming formulation through standard reformulation techniques. With these reformulation techniques, the resulting two-stage, convex mixed-integer quadratically constrained programming formulation can be efficiently solved using commercial quadratic programming solvers as demonstrated on a case study on a modified version of the IEEE 123-bus test system with 100 scenarios. We also quantify the uncertainties through a second case study using the following three standard metrics of two-stage stochastic optimization: the expected value of perfect information, the expected result of using the expected value solution and the value of the stochastic solution.     

An overview on fault diagnosis and nature-inspired optimal control of industrial process applications

Fault detection, isolation and optimal control have long been applied to industry. These techniques have proven various successful theoretical results and industrial applications. Fault diagnosis is considered as the merge of fault detection (that indicates if there is a fault) and fault isolation (that determines where the fault is), and it has important effects on the operation of complex dynamical systems specific to modern industry applications such as industrial electronics, business management systems, energy, and public sectors. Since the resources are always limited in real-world industrial applications, the solutions to optimally use them under various constraints are of high actuality. In this context, the optimal tuning of linear and nonlinear controllers is a systematic way to meet the performance specifications expressed as optimization problems that target the minimization of integral- or sum-type objective functions, where the tuning parameters of the controllers are the vector variables of the objective functions. The nature-inspired optimization algorithms give efficient solutions to such optimization problems. This paper presents an overview on recent developments in machine learning, data mining and evolving soft computing techniques for fault diagnosis and on nature-inspired optimal control. The generic theory is discussed along with illustrative industrial process applications that include a real liquid level control application, wind turbines and a nonlinear servo system. New research challenges with strong industrial impact are highlighted.     

Parameter estimation for a morphochemical reaction-diffusion model of electrochemical pattern formation

The process of electrodeposition can be described in terms of a reaction-diffusion partial differential equation (PDE) system that models the dynamics of the morphology profile and the chemical composition. Here we fit such a model to the different patterns present in a range of electrodeposited and electrochemically modified alloys using PDE constrained optimization. Experiments with simulated data show how the parameter space of the model can be divided into zones corresponding to the different physical patterns by examining the structure of an appropriate cost function. We then use real data to demonstrate how numerical optimization of the cost function can allow the model to fit the rich variety of patterns arising in experiments. The computational technique developed provides a potential tool for tuning experimental parameters to produce desired patterns.     

An automated treatment planning strategy for highly noncoplanar radiotherapy arc trajectories

Radiation therapy is a technology-driven cancer treatment modality that has experienced significant advances over the last decades, due to multidisciplinary contributions that include engineering and computing. Recent technological developments allow the use of noncoplanar volumetric modulated arc therapy (VMAT), one of the most recent photon treatment techniques, in clinical practice. In this work, an automated noncoplanar arc trajectory optimization framework designed in two modular phases is presented. First, a noncoplanar beam angle optimization algorithm is used to obtain a set of noncoplanar irradiation directions. Then, anchored in these directions, an optimization strategy is proposed to compute an optimal arc trajectory. The computational experiments considered a pool of twelve difficult head-and-neck tumor cases. It was possible to observe that, for some of these cases, the optimized noncoplanar arc trajectories led to significant treatment planning quality improvements, when compared with coplanar VMAT treatment plans. Although these experiments were done in a research environment treatment planning software (matRad), the conclusions can be of interest for a clinical setting: automated procedures can simplify the current treatment workflow, produce high-quality treatment plans, making better use of human resources and allowing for unbiased comparisons between different treatment techniques.     

Revisiting the Parallel Strategy for DOACROSS Loops

Journal of Computer Science and Technology - DOACROSS loops are significant parts in many important scientific and engineering applications, which are generally exploited pipeline/wave-front...     

Topology optimization for crashworthiness of thin-walled structures under axial crash considering nonlinear plastic buckling and locations of plastic hinges

Although topology optimization is established for linear static problems, more effort is required for solving nonlinear plastic problems. A new topology optimization approach with equivalent static loads (ESLs) is suggested to find the optimum topologies and locations of plastic hinges of thin-walled crash boxes by considering crash-induced deformation, the main crash energy-absorbing mechanism. Together with finite element method crashworthiness analyses, considering all nonlinearities with rate-dependent plasticity, the method was developed using an appropriate time-incremental scheme of ESLs without removing any high values of loads. Analyses show that the crash boxes with optimum topologies have energy-absorbing capabilities equivalent to the original structure. The proposed method is evaluated for two crashes: a crash box at low speed and a double cell subjected to high-speed collision. The results indicate that this method captures nonlinear crushing behaviours and accurate locations of plastic hinges where, if proper reinforcements are made, energy absorption can be enhanced.