CFA optimizer: A new and powerful algorithm inspired by Franklin's and Coulomb's laws theory for solving the economic load dispatch problems

Copyright © 2018 John Wiley & Sons, Ltd. This paper presents a new efficient algorithm inspired by Franklin's and Coulomb's laws theory that is referred to as CFA algorithm, for finding the global solutions of optimal economic load dispatch problems in power systems. CFA is based on the impact of electrically charged particles on each other due to electrical attraction and repulsion forces. The effectiveness of the CFA in different terms is tested on basic benchmark problems. Then, the quality of the CFA to achieve accurate results in different aspects is examined and proven on economic load dispatch problems including 4 different size cases, 6, 10, 15, and 110-unit test systems. Finally, the results are compared with other inspired algorithms as well as results reported in the literature. The simulation results provide evidence for the well-organized and efficient performance of the CFA algorithm in solving great diversity of nonlinear optimization problems

A hybrid Jaya algorithm for reliability–redundancy allocation problems

© 2017 Informa UK Limited, trading as Taylor & Francis Group. This article proposes an efficient improved hybrid Jaya algorithm based on time-varying acceleration coefficients (TVACs) and the learning phase introduced in teaching–learning-based optimization (TLBO), named the LJaya-TVAC algorithm, for solving various types of nonlinear mixed-integer reliability–redundancy allocation problems (RRAPs) and standard real-parameter test functions. RRAPs include series, series–parallel, complex (bridge) and overspeed protection systems. The search power of the proposed LJaya-TVAC algorithm for finding the optimal solutions is first tested on the standard real-parameter unimodal and multi-modal functions with dimensions of 30–100, and then tested on various types of nonlinear mixed-integer RRAPs. The results are compared with the original Jaya algorithm and the best results reported in the recent literature. The optimal results obtained with the proposed LJaya-TVAC algorithm provide evidence for its better and acceptable optimization performance compared to the original Jaya algorithm and other reported optimal results

The Study of Solving the Problem Having Multiple Search Spaces by Hierarchical Optimize Method Based on the Competitive

九州工業大学博士学位論文 学位記番号:生工博甲第266号 学位授与年月日:平成28年3月25日第1章 序論|第2章 問題設定と関連手法|第3章 複数解空間競合型分散GAの提案と多項式曲線フィッティングによる検証|第4章 階層的複数解空間競合型分散GAの提案と階層的な組み合わせ最適化問題への適用|第5章 結論九州工業大学平成27年

Military and Security Applications: Cybersecurity (Encyclopedia of Optimization, Third Edition)

The domain of cybersecurity is growing as part of broader military and security applications, and the capabilities and processes in this realm have qualities and characteristics that warrant using solution methods in mathematical optimization. Problems of interest may involve continuous or discrete variables, a convex or non-convex decision space, differing levels of uncertainty, and constrained or unconstrained frameworks. Cyberattacks, for example, can be modeled using hierarchical threat structures and may involve decision strategies from both an organization or individual and the adversary. Network traffic flow, intrusion detection and prevention systems, interconnected human-machine interfaces, and automated systems – these all require higher levels of complexity in mathematical optimization modeling and analysis. Attributes such as cyber resiliency, network adaptability, security capability, and information technology flexibility – these require the measurement of multiple characteristics, many of which may involve both quantitative and qualitative interpretations. And for nearly every organization that is invested in some cybersecurity practice, decisions must be made that involve the competing objectives of cost, risk, and performance. As such, mathematical optimization has been widely used and accepted to model important and complex decision problems, providing analytical evidence for helping drive decision outcomes in cybersecurity applications. In the paragraphs that follow, this chapter highlights some of the recent mathematical optimization research in the body of knowledge applied to the cybersecurity space. The subsequent literature discussed fits within a broader cybersecurity domain taxonomy considering the categories of analyze, collect and operate, investigate, operate and maintain, oversee and govern, protect and defend, and securely provision. Further, the paragraphs are structured around generalized mathematical optimization categories to provide a lens to summarize the existing literature, including uncertainty (stochastic programming, robust optimization, etc.), discrete (integer programming, multiobjective, etc.), continuous-unconstrained (nonlinear least squares, etc.), continuous-constrained (global optimization, etc.), and continuous-constrained (nonlinear programming, network optimization, linear programming, etc.). At the conclusion of this chapter, research implications and extensions are offered to the reader that desires to pursue further mathematical optimization research for cybersecurity within a broader military and security applications context

Cross-Layer Optimization and Dynamic Spectrum Access for Distributed Wireless Networks

We proposed a novel spectrum allocation approach for distributed cognitive radio networks. Cognitive radio systems are capable of sensing the prevailing environmental conditions and automatically adapting its operating parameters in order to enhance system and network performance. Using this technology, our proposed approach optimizes each individual wireless device and its single-hop communication links using the partial operating parameter and environmental information from adjacent devices within the wireless network. Assuming stationary wireless nodes, all wireless communication links employ non-contiguous orthogonal frequency division multiplexing (NC-OFDM) in order to enable dynamic spectrum access (DSA). The proposed approach will attempt to simultaneously minimize the bit error rate, minimize out-of-band (OOB) interference, and maximize overall throughput using a multi-objective fitness function. Without loss in generality, genetic algorithms are employed to perform the actual optimization. Two generic optimization approaches, subcarrier-wise approach and block-wise approach, were proposed to access spectrum. We also proposed and analyzed several approaches implemented via genetic algorithms (GA), such as quantizing variables, using adaptive variable ranges, and Multi-Objective Genetic Algorithms, for increasing the speed and improving the results of combined spectrum utilization/cross-layer optimization approaches proposed, together with several assisting processes and modifications devised to make the optimization to improve efficiency and execution time