Author

# Mohamed E. El-Hawary

Other affiliations: Howard University, University of Ontario Institute of Technology, Memorial University of Newfoundland ...read more

Bio: Mohamed E. El-Hawary is an academic researcher from Dalhousie University. The author has contributed to research in topics: Electric power system & AC power. The author has an hindex of 44, co-authored 382 publications receiving 8773 citations. Previous affiliations of Mohamed E. El-Hawary include Howard University & University of Ontario Institute of Technology.

##### Papers published on a yearly basis

##### Papers

More filters

••

TL;DR: This paper presents a comprehensive coverage of different PSO applications in solving optimization problems in the area of electric power systems and highlights the PSO key features and advantages over other various optimization algorithms.

Abstract: Particle swarm optimization (PSO) has received increased attention in many research fields recently. This paper presents a comprehensive coverage of different PSO applications in solving optimization problems in the area of electric power systems. It highlights the PSO key features and advantages over other various optimization algorithms. Furthermore, recent trends with regard to PSO development in this area are explored. This paper also discusses PSO possible future applications in the area of electric power systems and its potential theoretical studies.

686 citations

••

TL;DR: A new optimization approach that employs an artificial bee colony (ABC) algorithm to determine the optimal DG-unit's size, power factor, and location in order to minimize the total system real power loss.

Abstract: Distributed generation (DG) has been utilized in some electric power networks. Power loss reduction, environmental friendliness, voltage improvement, postponement of system upgrading, and increasing reliability are some advantages of DG-unit application. This paper presents a new optimization approach that employs an artificial bee colony (ABC) algorithm to determine the optimal DG-unit's size, power factor, and location in order to minimize the total system real power loss. The ABC algorithm is a new metaheuristic, population-based optimization technique inspired by the intelligent foraging behavior of the honeybee swarm. To reveal the validity of the ABC algorithm, sample radial distribution feeder systems are examined with different test cases. Furthermore, the results obtained by the proposed ABC algorithm are compared with those attained via other methods. The outcomes verify that the ABC algorithm is efficient, robust, and capable of handling mixed integer nonlinear optimization problems. The ABC algorithm has only two parameters to be tuned. Therefore, the updating of the two parameters towards the most effective values has a higher likelihood of success than in other competing metaheuristic methods.

652 citations

••

TL;DR: In this paper, the authors present a summary of algorithms of environmental-economic dispatch in electric power systems since 1970, which attempt to reduce the production of atmospheric emissions such as NO/sub x/ and SO/sub X/ caused by the operation of fossil-fueled thermal generation.

Abstract: Traditionally electric power systems are operated in such a way that the total fuel cost is minimized regardless of emissions produced. With increased requirements for environmental protection, alternative strategies are required. This paper presents a summary of algorithms of environmental-economic dispatch in electric power systems since 1970. The algorithms attempt to reduce the production of atmospheric emissions such as NO/sub x/ and SO/sub x/ caused by the operation of fossil-fueled thermal generation. Such reduction is achieved by including emissions either as a constraint or as a weighted function the objective of the overall dispatching problem. >

459 citations

••

TL;DR: A particle swarm optimization (PSO) algorithm is employed to adjust the network's weights in the training phase of the ANNs to create a more reliable forecasting model.

Abstract: The paper addresses the problem of predicting hourly load demand using adaptive artificial neural networks (ANNs). A particle swarm optimization (PSO) algorithm is employed to adjust the network's weights in the training phase of the ANNs. The advantage of using a PSO algorithm over other conventional training algorithms such as the back-propagation (BP) is that potential solutions will be flown through the problem hyperspace with accelerated movement towards the best solution. Thus the training phase should result in obtaining the weights configuration associated with the minimum output error. Data are wavelet transformed during the preprocessing stage and then inserted into the neural network to extract redundant information from the load curve. This results in better load characterization which creates a more reliable forecasting model. The transformed data of historical load and weather information were trained and tested over various periods of time. The generalized error estimation is done by using the reverse part of the data as a ldquotestrdquo set. The results were compared with traditional BP algorithm and offered a high forecasting precision.

373 citations

••

01 Dec 2016TL;DR: In this paper, the authors introduce Smart Grid and associated technical, environmental and socioeconomic, and other non-tangible benefits to society, and articulates the need for the concept and the fact that it is a dynamic interactive, real-time infrastructure that responds to the challenges of designing and building the power system of the future, rather than being simply a marketing term.

Abstract: This presentation introduces Smart Grid and associated technical, environmental and socio-economic, and other non-tangible benefits to society, and articulates the need for the concept and the fact that it is a dynamic interactive, real-time infrastructure that responds to the challenges of designing and building the power system of the future, rather than being simply a marketing term. To illustrate the diversity of terminology, we compare an Electric Power Research Institute (EPRI) definition with that suggested by a study group of the International Electrotechnical Commission (IEC). Next, a paper sponsored by the Canadian Electricity Association (CEA) that cites three example definitions to highlight the diversity of views of Smart Grid is briefly reviewed. Early misconceptions and characterizations of Smart Grid are discussed as a prelude to addressing challenging issues that motivate developing and implementing related innovative technologies, products and services. We then discuss the potential promise of the Smart Grid, which is embedded in its often-cited attributes of efficiency, accommodating, quality focus, enabling and self-healing to name some. The presentation then addresses some of the often-cited impediments to accepting Smart Grid which are based on concerns and issues confronting its forward progress, adoption and acceptance. Distribution Automation (DA) and embedded intelligence are discussed emphasizing self-healing, optimizing operation and facilitating recreation and recovery from abnormal events. Functional and integration requirements of Distributed Energy Resources (DER,) are detailed. Smart Consumption Infrastructure elements of Distribution Management Systems (DMS,) Automated Metering Infrastructure (AMI,) Smart Homes (SH), and Smart Appliances (SA,) are discussed. We discuss smart grid activities in China, India, and the development of a Smart Grid roadmap for the US State of Kentucky. The approaches of each of these cases reflect the diversity of policy initiatives in these jurisdictions. State of the art reviews of distribution network active management and future development trends in technologies and methods, where centralized and decentralized management frameworks and applying agent-based coordination are discussed. A review of smart home technologies and the goals of an energy management system (SHEMS) are also discussed.

289 citations

##### Cited by

More filters

••

TL;DR: Preface to the Princeton Landmarks in Biology Edition vii Preface xi Symbols used xiii 1.

Abstract: Preface to the Princeton Landmarks in Biology Edition vii Preface xi Symbols Used xiii 1. The Importance of Islands 3 2. Area and Number of Speicies 8 3. Further Explanations of the Area-Diversity Pattern 19 4. The Strategy of Colonization 68 5. Invasibility and the Variable Niche 94 6. Stepping Stones and Biotic Exchange 123 7. Evolutionary Changes Following Colonization 145 8. Prospect 181 Glossary 185 References 193 Index 201

14,171 citations

•

9,185 citations

••

TL;DR: A detailed review of the basic concepts of DE and a survey of its major variants, its application to multiobjective, constrained, large scale, and uncertain optimization problems, and the theoretical studies conducted on DE so far are presented.

Abstract: Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms in current use. DE operates through similar computational steps as employed by a standard evolutionary algorithm (EA). However, unlike traditional EAs, the DE-variants perturb the current-generation population members with the scaled differences of randomly selected and distinct population members. Therefore, no separate probability distribution has to be used for generating the offspring. Since its inception in 1995, DE has drawn the attention of many researchers all over the world resulting in a lot of variants of the basic algorithm with improved performance. This paper presents a detailed review of the basic concepts of DE and a survey of its major variants, its application to multiobjective, constrained, large scale, and uncertain optimization problems, and the theoretical studies conducted on DE so far. Also, it provides an overview of the significant engineering applications that have benefited from the powerful nature of DE.

4,321 citations

•

01 Jan 2011

TL;DR: This chapter discusses Optimization Techniques, which are used in Linear Programming I and II, and Nonlinear Programming II, which is concerned with One-Dimensional Minimization.

Abstract: Preface. 1 Introduction to Optimization. 1.1 Introduction. 1.2 Historical Development. 1.3 Engineering Applications of Optimization. 1.4 Statement of an Optimization Problem. 1.5 Classification of Optimization Problems. 1.6 Optimization Techniques. 1.7 Engineering Optimization Literature. 1.8 Solution of Optimization Problems Using MATLAB. References and Bibliography. Review Questions. Problems. 2 Classical Optimization Techniques. 2.1 Introduction. 2.2 Single-Variable Optimization. 2.3 Multivariable Optimization with No Constraints. 2.4 Multivariable Optimization with Equality Constraints. 2.5 Multivariable Optimization with Inequality Constraints. 2.6 Convex Programming Problem. References and Bibliography. Review Questions. Problems. 3 Linear Programming I: Simplex Method. 3.1 Introduction. 3.2 Applications of Linear Programming. 3.3 Standard Form of a Linear Programming Problem. 3.4 Geometry of Linear Programming Problems. 3.5 Definitions and Theorems. 3.6 Solution of a System of Linear Simultaneous Equations. 3.7 Pivotal Reduction of a General System of Equations. 3.8 Motivation of the Simplex Method. 3.9 Simplex Algorithm. 3.10 Two Phases of the Simplex Method. 3.11 MATLAB Solution of LP Problems. References and Bibliography. Review Questions. Problems. 4 Linear Programming II: Additional Topics and Extensions. 4.1 Introduction. 4.2 Revised Simplex Method. 4.3 Duality in Linear Programming. 4.4 Decomposition Principle. 4.5 Sensitivity or Postoptimality Analysis. 4.6 Transportation Problem. 4.7 Karmarkar's Interior Method. 4.8 Quadratic Programming. 4.9 MATLAB Solutions. References and Bibliography. Review Questions. Problems. 5 Nonlinear Programming I: One-Dimensional Minimization Methods. 5.1 Introduction. 5.2 Unimodal Function. ELIMINATION METHODS. 5.3 Unrestricted Search. 5.4 Exhaustive Search. 5.5 Dichotomous Search. 5.6 Interval Halving Method. 5.7 Fibonacci Method. 5.8 Golden Section Method. 5.9 Comparison of Elimination Methods. INTERPOLATION METHODS. 5.10 Quadratic Interpolation Method. 5.11 Cubic Interpolation Method. 5.12 Direct Root Methods. 5.13 Practical Considerations. 5.14 MATLAB Solution of One-Dimensional Minimization Problems. References and Bibliography. Review Questions. Problems. 6 Nonlinear Programming II: Unconstrained Optimization Techniques. 6.1 Introduction. DIRECT SEARCH METHODS. 6.2 Random Search Methods. 6.3 Grid Search Method. 6.4 Univariate Method. 6.5 Pattern Directions. 6.6 Powell's Method. 6.7 Simplex Method. INDIRECT SEARCH (DESCENT) METHODS. 6.8 Gradient of a Function. 6.9 Steepest Descent (Cauchy) Method. 6.10 Conjugate Gradient (Fletcher-Reeves) Method. 6.11 Newton's Method. 6.12 Marquardt Method. 6.13 Quasi-Newton Methods. 6.14 Davidon-Fletcher-Powell Method. 6.15 Broyden-Fletcher-Goldfarb-Shanno Method. 6.16 Test Functions. 6.17 MATLAB Solution of Unconstrained Optimization Problems. References and Bibliography. Review Questions. Problems. 7 Nonlinear Programming III: Constrained Optimization Techniques. 7.1 Introduction. 7.2 Characteristics of a Constrained Problem. DIRECT METHODS. 7.3 Random Search Methods. 7.4 Complex Method. 7.5 Sequential Linear Programming. 7.6 Basic Approach in the Methods of Feasible Directions. 7.7 Zoutendijk's Method of Feasible Directions. 7.8 Rosen's Gradient Projection Method. 7.9 Generalized Reduced Gradient Method. 7.10 Sequential Quadratic Programming. INDIRECT METHODS. 7.11 Transformation Techniques. 7.12 Basic Approach of the Penalty Function Method. 7.13 Interior Penalty Function Method. 7.14 Convex Programming Problem. 7.15 Exterior Penalty Function Method. 7.16 Extrapolation Techniques in the Interior Penalty Function Method. 7.17 Extended Interior Penalty Function Methods. 7.18 Penalty Function Method for Problems with Mixed Equality and Inequality Constraints. 7.19 Penalty Function Method for Parametric Constraints. 7.20 Augmented Lagrange Multiplier Method. 7.21 Checking the Convergence of Constrained Optimization Problems. 7.22 Test Problems. 7.23 MATLAB Solution of Constrained Optimization Problems. References and Bibliography. Review Questions. Problems. 8 Geometric Programming. 8.1 Introduction. 8.2 Posynomial. 8.3 Unconstrained Minimization Problem. 8.4 Solution of an Unconstrained Geometric Programming Program Using Differential Calculus. 8.5 Solution of an Unconstrained Geometric Programming Problem Using Arithmetic-Geometric Inequality. 8.6 Primal-Dual Relationship and Sufficiency Conditions in the Unconstrained Case. 8.7 Constrained Minimization. 8.8 Solution of a Constrained Geometric Programming Problem. 8.9 Primal and Dual Programs in the Case of Less-Than Inequalities. 8.10 Geometric Programming with Mixed Inequality Constraints. 8.11 Complementary Geometric Programming. 8.12 Applications of Geometric Programming. References and Bibliography. Review Questions. Problems. 9 Dynamic Programming. 9.1 Introduction. 9.2 Multistage Decision Processes. 9.3 Concept of Suboptimization and Principle of Optimality. 9.4 Computational Procedure in Dynamic Programming. 9.5 Example Illustrating the Calculus Method of Solution. 9.6 Example Illustrating the Tabular Method of Solution. 9.7 Conversion of a Final Value Problem into an Initial Value Problem. 9.8 Linear Programming as a Case of Dynamic Programming. 9.9 Continuous Dynamic Programming. 9.10 Additional Applications. References and Bibliography. Review Questions. Problems. 10 Integer Programming. 10.1 Introduction 588. INTEGER LINEAR PROGRAMMING. 10.2 Graphical Representation. 10.3 Gomory's Cutting Plane Method. 10.4 Balas' Algorithm for Zero-One Programming Problems. INTEGER NONLINEAR PROGRAMMING. 10.5 Integer Polynomial Programming. 10.6 Branch-and-Bound Method. 10.7 Sequential Linear Discrete Programming. 10.8 Generalized Penalty Function Method. 10.9 Solution of Binary Programming Problems Using MATLAB. References and Bibliography. Review Questions. Problems. 11 Stochastic Programming. 11.1 Introduction. 11.2 Basic Concepts of Probability Theory. 11.3 Stochastic Linear Programming. 11.4 Stochastic Nonlinear Programming. 11.5 Stochastic Geometric Programming. References and Bibliography. Review Questions. Problems. 12 Optimal Control and Optimality Criteria Methods. 12.1 Introduction. 12.2 Calculus of Variations. 12.3 Optimal Control Theory. 12.4 Optimality Criteria Methods. References and Bibliography. Review Questions. Problems. 13 Modern Methods of Optimization. 13.1 Introduction. 13.2 Genetic Algorithms. 13.3 Simulated Annealing. 13.4 Particle Swarm Optimization. 13.5 Ant Colony Optimization. 13.6 Optimization of Fuzzy Systems. 13.7 Neural-Network-Based Optimization. References and Bibliography. Review Questions. Problems. 14 Practical Aspects of Optimization. 14.1 Introduction. 14.2 Reduction of Size of an Optimization Problem. 14.3 Fast Reanalysis Techniques. 14.4 Derivatives of Static Displacements and Stresses. 14.5 Derivatives of Eigenvalues and Eigenvectors. 14.6 Derivatives of Transient Response. 14.7 Sensitivity of Optimum Solution to Problem Parameters. 14.8 Multilevel Optimization. 14.9 Parallel Processing. 14.10 Multiobjective Optimization. 14.11 Solution of Multiobjective Problems Using MATLAB. References and Bibliography. Review Questions. Problems. A Convex and Concave Functions. B Some Computational Aspects of Optimization. B.1 Choice of Method. B.2 Comparison of Unconstrained Methods. B.3 Comparison of Constrained Methods. B.4 Availability of Computer Programs. B.5 Scaling of Design Variables and Constraints. B.6 Computer Programs for Modern Methods of Optimization. References and Bibliography. C Introduction to MATLAB(R) . C.1 Features and Special Characters. C.2 Defining Matrices in MATLAB. C.3 CREATING m-FILES. C.4 Optimization Toolbox. Answers to Selected Problems. Index .

3,283 citations

••

TL;DR: This paper presents a detailed overview of the basic concepts of PSO and its variants, and provides a comprehensive survey on the power system applications that have benefited from the powerful nature ofPSO as an optimization technique.

Abstract: Many areas in power systems require solving one or more nonlinear optimization problems. While analytical methods might suffer from slow convergence and the curse of dimensionality, heuristics-based swarm intelligence can be an efficient alternative. Particle swarm optimization (PSO), part of the swarm intelligence family, is known to effectively solve large-scale nonlinear optimization problems. This paper presents a detailed overview of the basic concepts of PSO and its variants. Also, it provides a comprehensive survey on the power system applications that have benefited from the powerful nature of PSO as an optimization technique. For each application, technical details that are required for applying PSO, such as its type, particle formulation (solution representation), and the most efficient fitness functions are also discussed.

2,147 citations