scholarly journals A New “Doctor and Patient” Optimization Algorithm: An Application to Energy Commitment Problem

2020 ◽  
Vol 10 (17) ◽  
pp. 5791 ◽  
Author(s):  
Mohammad Dehghani ◽  
Mohammad Mardaneh ◽  
Josep M. Guerrero ◽  
Om Parkash Malik ◽  
Ricardo A. Ramirez-Mendoza ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Standard Test ◽  
Objective Functions ◽  
Test Function ◽  
Commitment Problem ◽  
New Ideas ◽  
Patient Optimization ◽  
Research World

Regular assessments of events taking place around the globe can be a conduit for the development of new ideas, contributing to the research world. In this study, the authors present a new optimization algorithm named doctor and patient optimization (DPO). DPO is designed by simulating the process of treating patients by a physician. The treatment process has three phases, including vaccination, drug administration, and surgery. The efficiency of the proposed algorithm in solving optimization problems compared to eight other optimization algorithms on a benchmark standard test function with 23 objective functions is been evaluated. The results obtained from this comparison indicate the superiority and quality of DPO in solving optimization problems in various sciences. The proposed algorithm is successfully applied to solve the energy commitment problem for a power system supplied by a multiple energy carriers system.

scholarly journals An evolutionary-based optimization algorithm for truss sizing design

2016 ◽  
Vol 38 (4) ◽  
pp. 307-317
Author(s):  
Pham Hoang Anh
Keyword(s):  
Local Search ◽  
Objective Function ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Optimal Solution ◽  
The Other ◽  
Truss Structures ◽  
Benchmark Problems ◽  
Discrete Variables ◽  
Objective Functions

In this paper, the optimal sizing of truss structures is solved using a novel evolutionary-based optimization algorithm. The efficiency of the proposed method lies in the combination of global search and local search, in which the global move is applied for a set of random solutions whereas the local move is performed on the other solutions in the search population. Three truss sizing benchmark problems with discrete variables are used to examine the performance of the proposed algorithm. Objective functions of the optimization problems are minimum weights of the whole truss structures and constraints are stress in members and displacement at nodes. Here, the constraints and objective function are treated separately so that both function and constraint evaluations can be saved. The results show that the new algorithm can find optimal solution effectively and it is competitive with some recent metaheuristic algorithms in terms of number of structural analyses required.

scholarly journals An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems

2022 ◽  
Vol 19 (1) ◽  
pp. 473-512
Author(s):  
Rong Zheng ◽  
◽  
Heming Jia ◽  
Laith Abualigah ◽  
Qingxin Liu ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Heuristic Method ◽  
Population Diversity ◽  
Test Functions ◽  
Design Problems ◽  
Local Optima ◽  
Switching Mechanism ◽  
Engineering Design Problems

<abstract> <p>Arithmetic optimization algorithm (AOA) is a newly proposed meta-heuristic method which is inspired by the arithmetic operators in mathematics. However, the AOA has the weaknesses of insufficient exploration capability and is likely to fall into local optima. To improve the searching quality of original AOA, this paper presents an improved AOA (IAOA) integrated with proposed forced switching mechanism (FSM). The enhanced algorithm uses the random math optimizer probability (<italic>RMOP</italic>) to increase the population diversity for better global search. And then the forced switching mechanism is introduced into the AOA to help the search agents jump out of the local optima. When the search agents cannot find better positions within a certain number of iterations, the proposed FSM will make them conduct the exploratory behavior. Thus the cases of being trapped into local optima can be avoided effectively. The proposed IAOA is extensively tested by twenty-three classical benchmark functions and ten CEC2020 test functions and compared with the AOA and other well-known optimization algorithms. The experimental results show that the proposed algorithm is superior to other comparative algorithms on most of the test functions. Furthermore, the test results of two training problems of multi-layer perceptron (MLP) and three classical engineering design problems also indicate that the proposed IAOA is highly effective when dealing with real-world problems.</p> </abstract>

Scope of Biogeography Based Optimization for Economic Load Dispatch and Multi-Objective Unit Commitment Problem

2014 ◽  
Vol 3 (4) ◽  
pp. 34-54 ◽  
Author(s):  
Vikram Kumar Kamboj ◽  
S.K. Bath
Keyword(s):  
Optimization Algorithm ◽  
Unit Commitment ◽  
Optimization Problems ◽  
Simple Procedure ◽  
Mathematical Formulation ◽  
Economic Load Dispatch ◽  
Unit Commitment Problem ◽  
Multi Objective ◽  
Commitment Problem ◽  
Population Based Algorithm

Biogeography Based Optimization (BBO) algorithm is a population-based algorithm based on biogeography concept, which uses the idea of the migration strategy of animals or other spices for solving optimization problems. Biogeography Based Optimization algorithm has a simple procedure to find the optimal solution for the non-smooth and non-convex problems through the steps of migration and mutation. This research paper presents the solution to Economic Load Dispatch Problem for IEEE 3, 4, 6 and 10-unit generating model using Biogeography Based Optimization algorithm. It also presents the mathematical formulation of scalar and multi-objective unit commitment problem, which is a further extension of economic load dispatch problem.

scholarly journals Improved Fitness-Dependent Optimizer Algorithm

2020 ◽  
Author(s):  
Danial A. Muhammed ◽  
Soran AM. Saeed ◽  
Tarik A. Rashid
Keyword(s):  
Optimization Problems ◽  
Optimal Solution ◽  
Standard Test ◽  
Particle Swarm Algorithm ◽  
Test Function ◽  
Dragonfly Algorithm ◽  
Whale Optimization ◽  
Real World Applications ◽  
Swarm Algorithm ◽  
Benchmark Test Functions

<div> <table> <tr> <td> <p>The fitness-dependent optimizer (FDO) algorithm was recently introduced in 2019. An improved FDO (IFDO) algorithm is presented in this work, and this algorithm contributes considerably to refining the ability of the original FDO to address complicated optimization problems. To improve the FDO, the IFDO calculates the alignment and cohesion and then uses these behaviors with the pace at which the FDO updates its position. Moreover, in determining the weights, the FDO uses the weight factor ( ), which is zero in most cases and one in only a few cases. Conversely, the IFDO performs randomization in the [0-1] range and then minimizes the range when a better fitness weight value is achieved. In this work, the IFDO algorithm and its method of converging on the optimal solution are demonstrated. Additionally, 19 classical standard test function groups are utilized to test the IFDO, and then the FDO and three other well-known algorithms, namely, the particle swarm algorithm (PSO), dragonfly algorithm (DA), and genetic algorithm (GA), are selected to evaluate the IFDO results. Furthermore, the CECC06 2019 Competition, which is the set of IEEE Congress of Evolutionary Computation benchmark test functions, is utilized to test the IFDO, and then, the FDO and three recent algorithms, namely, the salp swarm algorithm (SSA), DA and whale optimization algorithm (WOA), are chosen to gauge the IFDO results. The results show that IFDO is practical in some cases, and its results are improved in most cases. Finally, to prove the practicability of the IFDO, it is used in real-world applications.</p> </td> </tr> </table> </div> <br>

scholarly journals A Brief Look at Multi-Criteria Problems: Multi-Threshold Optimization versus Pareto-Optimization

2020 ◽  
Author(s):  
Nodari Vakhania ◽  
Frank Werner
Keyword(s):  
Optimization Problems ◽  
Optimality Criteria ◽  
General Notion ◽  
Objective Functions ◽  
Objective Criterion ◽  
Solution Quality ◽  
Pareto Optimal Set ◽  
Threshold Optimization ◽  
Feasible Solutions

Multi-objective optimization problems are important as they arise in many practical circumstances. In such problems, there is no general notion of optimality, as there are different objective criteria which can be contradictory. In practice, often there is no unique optimality criterion for measuring the solution quality. The latter is rather determined by the value of the solution for each objective criterion. In fact, a practitioner seeks for a solution that has an acceptable value of each of the objective functions and, in practice, there may be different tolerances to the quality of the delivered solution for different objective functions: for some objective criteria, solutions that are far away from an optimal one can be acceptable. Traditional Pareto-optimality approach aims to create all non-dominated feasible solutions in respect to all the optimality criteria. This often requires an inadmissible time. Besides, it is not evident how to choose an appropriate solution from the Pareto-optimal set of feasible solutions, which can be very large. Here we propose a new approach and call it multi-threshold optimization setting that takes into account different requirements for different objective criteria and so is more flexible and can often be solved in a more efficient way.

scholarly journals EWOA-OPF: Effective Whale Optimization Algorithm to Solve Optimal Power Flow Problem

Electronics ◽  
2021 ◽  
Vol 10 (23) ◽  
pp. 2975
Author(s):  
Mohammad H. Nadimi-Shahraki ◽  
Shokooh Taghian ◽  
Seyedali Mirjalili ◽  
Laith Abualigah ◽  
Mohamed Abd Abd Elaziz ◽  
...  
Keyword(s):  
Power System ◽  
Optimization Algorithm ◽  
Power Flow ◽  
Optimal Power Flow ◽  
Optimization Problems ◽  
Whale Optimization Algorithm ◽  
Objective Functions ◽  
Multi Objective ◽  
Optimal Power ◽  
Whale Optimization

The optimal power flow (OPF) is a vital tool for optimizing the control parameters of a power system by considering the desired objective functions subject to system constraints. Metaheuristic algorithms have been proven to be well-suited for solving complex optimization problems. The whale optimization algorithm (WOA) is one of the well-regarded metaheuristics that is widely used to solve different optimization problems. Despite the use of WOA in different fields of application as OPF, its effectiveness is decreased as the dimension size of the test system is increased. Therefore, in this paper, an effective whale optimization algorithm for solving optimal power flow problems (EWOA-OPF) is proposed. The main goal of this enhancement is to improve the exploration ability and maintain a proper balance between the exploration and exploitation of the canonical WOA. In the proposed algorithm, the movement strategy of whales is enhanced by introducing two new movement strategies: (1) encircling the prey using Levy motion and (2) searching for prey using Brownian motion that cooperate with canonical bubble-net attacking. To validate the proposed EWOA-OPF algorithm, a comparison among six well-known optimization algorithms is established to solve the OPF problem. All algorithms are used to optimize single- and multi-objective functions of the OPF under the system constraints. Standard IEEE 6-bus, IEEE 14-bus, IEEE 30-bus, and IEEE 118-bus test systems are used to evaluate the proposed EWOA-OPF and comparative algorithms for solving the OPF problem in diverse power system scale sizes. The comparison of results proves that the EWOA-OPF is able to solve single- and multi-objective OPF problems with better solutions than other comparative algorithms.

Constraint Solving and Optimization Using Evolutionary Techniques

2019 ◽  
Author(s):  
Mahdi Bidar ◽  
Malek Mouhoub
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Constraint Solving ◽  
High Dimensional ◽  
Constraint Optimization ◽  
Objective Functions ◽  
Search Spaces ◽  
Real World Applications ◽  
Constraint Optimization Problems

Constraint Solving and Optimization is very relevant in many real world applications including scheduling, planning, configuration, resource allocation and timetabling. Solving a constraint optimization problem consists of finding an assignment of values to variables that optimizes some defined objective functions, subject to a set of constraints imposed on the problem variables. Due to their high dimensional and exponential search spaces, classical methods are unpractical to tackle these problems. An appropriate alternative is to rely on metaheuristics. My thesis is concerned with investigating the applicability of the evolutionary algorithms when dealing with constraint optimization problems. In this regard, we propose two new optimization algorithms namely Mushroom Reproduction Optimization algorithm (MRO) and Focus Group Optimization algorithm (FGO) for solving such problems.

A New Hybrid Algorithm for Multi-Objective Robust Optimization With Interval Uncertainty

2015 ◽  
Vol 137 (2) ◽  
Author(s):  
Shuo Cheng ◽  
Jianhua Zhou ◽  
Mian Li
Keyword(s):  
Robust Optimization ◽  
Optimization Problems ◽  
Hybrid Approach ◽  
Interval Uncertainty ◽  
Engineering Optimization ◽  
Objective Functions ◽  
Robust Solutions ◽  
Multi Objective ◽  
And Performance

Uncertainty is a very critical but inevitable issue in design optimization. Compared to single-objective optimization problems, the situation becomes more difficult for multi-objective engineering optimization problems under uncertainty. Multi-objective robust optimization (MORO) approaches have been developed to find Pareto robust solutions. While the literature reports on many techniques in MORO, few papers focus on using multi-objective differential evolution (MODE) for robust optimization (RO) and performance improvement of its solutions. In this article, MODE is first modified and developed for RO problems with interval uncertainty, formulating a new MODE-RO algorithm. To improve the solutions’ quality of MODE-RO, a new hybrid (MODE-sequential quadratic programming (SQP)-RO) algorithm is proposed further, where SQP is incorporated into the procedure to enhance the local search. The proposed hybrid approach takes the advantage of MODE for its capability of handling not-well behaved robust constraint functions and SQP for its fast local convergence. Two numerical and one engineering examples, with two or three objective functions, are tested to demonstrate the applicability and performance of the proposed algorithms. The results show that MODE-RO is effective in solving MORO problems while, on the average, MODE-SQP-RO improves the quality of robust solutions obtained by MODE-RO with comparable numbers of function evaluations.

scholarly journals Adaptive Plant Propagation Algorithm for Solving Economic Load Dispatch Problem

2017 ◽  
Author(s):  
Sayan Nag
Keyword(s):  
Optimization Problems ◽  
State Of The Art ◽  
Economic Load Dispatch ◽  
Objective Functions ◽  
Plant Propagation ◽  
Propagation Algorithm ◽  
Highly Nonlinear ◽  
Plant Intelligence ◽  
Classical Optimization

Optimization problems in design engineering are complex by nature, often because of the involvement of critical objective functions accompanied by a number of rigid constraints associated with the products involved. One such problem is Economic Load Dispatch (ED) problem which focuses on the optimization of the fuel cost while satisfying some system constraints. Classical optimization algorithms are not sufficient and also inefficient for the ED problem involving highly nonlinear, and non-convex functions both in the objective and in the constraints. This led to the development of metaheuristic optimization approaches which can solve the ED problem almost efficiently. This paper presents a novel robust plant intelligence based Adaptive Plant Propagation Algorithm (APPA) which is used to solve the classical ED problem. The application of the proposed method to the 3-generator and 6-generator systems shows the efficiency and robustness of the proposed algorithm. A comparative study with another state-of-the-art algorithm (APSO) demonstrates the quality of the solution achieved by the proposed method along with the convergence characteristics of the proposed approach.

scholarly journals Improved Fitness-Dependent Optimizer Algorithm

2020 ◽  
Author(s):  
Danial A. Muhammed ◽  
Soran AM. Saeed ◽  
Tarik A. Rashid
Keyword(s):  
Optimization Problems ◽  
Optimal Solution ◽  
Standard Test ◽  
Particle Swarm Algorithm ◽  
Test Function ◽  
Dragonfly Algorithm ◽  
Whale Optimization ◽  
Real World Applications ◽  
Swarm Algorithm ◽  
Benchmark Test Functions

<div> <table> <tr> <td> <p>The fitness-dependent optimizer (FDO) algorithm was recently introduced in 2019. An improved FDO (IFDO) algorithm is presented in this work, and this algorithm contributes considerably to refining the ability of the original FDO to address complicated optimization problems. To improve the FDO, the IFDO calculates the alignment and cohesion and then uses these behaviors with the pace at which the FDO updates its position. Moreover, in determining the weights, the FDO uses the weight factor ( ), which is zero in most cases and one in only a few cases. Conversely, the IFDO performs randomization in the [0-1] range and then minimizes the range when a better fitness weight value is achieved. In this work, the IFDO algorithm and its method of converging on the optimal solution are demonstrated. Additionally, 19 classical standard test function groups are utilized to test the IFDO, and then the FDO and three other well-known algorithms, namely, the particle swarm algorithm (PSO), dragonfly algorithm (DA), and genetic algorithm (GA), are selected to evaluate the IFDO results. Furthermore, the CECC06 2019 Competition, which is the set of IEEE Congress of Evolutionary Computation benchmark test functions, is utilized to test the IFDO, and then, the FDO and three recent algorithms, namely, the salp swarm algorithm (SSA), DA and whale optimization algorithm (WOA), are chosen to gauge the IFDO results. The results show that IFDO is practical in some cases, and its results are improved in most cases. Finally, to prove the practicability of the IFDO, it is used in real-world applications.</p> </td> </tr> </table> </div> <br>

Sign in / Sign up

Export Citation Format

Share Document