A Heuristic Approach for Multi Objective Distribution Feeder Reconfiguration

2010 ◽  
Vol 1 (2) ◽  
pp. 60-73 ◽  
Author(s):  
Armin Ebrahimi Milani ◽  
Mahmood Reza Haghifam
Keyword(s):  
Genetic Algorithm ◽  
Fuzzy Set ◽  
Objective Functions ◽  
Suggested Model ◽  
Heuristic Rules ◽  
Multi Objective ◽  
Operation Process ◽  
Distribution Feeder Reconfiguration ◽  
The Status ◽  
Linear Objective Functions

The reconfiguration is an operation process used for optimization with specific objectives by means of changing the status of switches in a distribution network. This paper presents an algorithm for network recon-figuration based on the heuristic rules and fuzzy multi objective approach where each objective is normalized with inspiration from fuzzy set to cause optimization more flexible and formulized as a unique multi objective function. Also, the genetic algorithm is used for solving the suggested model, in which there is no risk of non-linear objective functions and constraints. The effectiveness of the proposed method is demonstrated through several examples in this paper.

A Heuristic Approach for Multi Objective Distribution Feeder Reconfiguration

2012 ◽  
pp. 130-142
Author(s):  
Armin Ebrahimi Milani ◽  
Mahmood Reza Haghifam
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Fuzzy Set ◽  
Distribution Network ◽  
Heuristic Rules ◽  
Multi Objective ◽  
Operation Process ◽  
Distribution Feeder Reconfiguration ◽  
The Status ◽  
Linear Objective Functions

The reconfiguration is an operation process used for optimization with specific objectives by means of changing the status of switches in a distribution network. This paper presents an algorithm for network recon-figuration based on the heuristic rules and fuzzy multi objective approach where each objective is normalized with inspiration from fuzzy set to cause optimization more flexible and formulized as a unique multi objective function. Also, the genetic algorithm is used for solving the suggested model, in which there is no risk of non-linear objective functions and constraints. The effectiveness of the proposed method is demonstrated through several examples in this paper.

scholarly journals A Method for Integration of Preferences to a Multi-Objective Evolutionary Algorithm Using Ordinal Multi-Criteria Classification

2021 ◽  
Vol 26 (2) ◽  
pp. 27
Author(s):  
Alejandro Castellanos-Alvarez ◽  
Laura Cruz-Reyes ◽  
Eduardo Fernandez ◽  
Nelson Rangel-Valdez ◽  
Claudia Gómez-Santillán ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Selective Pressure ◽  
Optimization Problems ◽  
Region Of Interest ◽  
Decision Makers ◽  
Multiple Objective ◽  
Objective Functions ◽  
Multi Objective ◽  
Imperfect Knowledge ◽  
Real World Problems

Most real-world problems require the optimization of multiple objective functions simultaneously, which can conflict with each other. The environment of these problems usually involves imprecise information derived from inaccurate measurements or the variability in decision-makers’ (DMs’) judgments and beliefs, which can lead to unsatisfactory solutions. The imperfect knowledge can be present either in objective functions, restrictions, or decision-maker’s preferences. These optimization problems have been solved using various techniques such as multi-objective evolutionary algorithms (MOEAs). This paper proposes a new MOEA called NSGA-III-P (non-nominated sorting genetic algorithm III with preferences). The main characteristic of NSGA-III-P is an ordinal multi-criteria classification method for preference integration to guide the algorithm to the region of interest given by the decision-maker’s preferences. Besides, the use of interval analysis allows the expression of preferences with imprecision. The experiments contrasted several versions of the proposed method with the original NSGA-III to analyze different selective pressure induced by the DM’s preferences. In these experiments, the algorithms solved three-objectives instances of the DTLZ problem. The obtained results showed a better approximation to the region of interest for a DM when its preferences are considered.

Kinematic Multi-Objective Optimization of Circular-Toothed Gerotor Pumps by Genetic Algorithm

2017 ◽  
Author(s):  
Andrew J. Robison ◽  
Andrea Vacca
Keyword(s):  
Genetic Algorithm ◽  
Design Method ◽  
Third Party ◽  
Low Flow ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Generation Algorithm ◽  
Multi Objective ◽  
Pareto Curve

A gerotor gear generation algorithm has been developed that evaluates key performance objective functions to be minimized or maximized, and then an optimization algorithm is applied to determine the best design. Because of their popularity, circular-toothed gerotors are the focus of this study, and future work can extend this procedure to other gear forms. Parametric equations defining the circular-toothed gear set have been derived and implemented. Two objective functions were used in this kinematic optimization: maximize the ratio of displacement to pump radius, which is a measure of compactness, and minimize the kinematic flow ripple, which can have a negative effect on system dynamics and could be a major source of noise. Designs were constrained to ensure drivability, so the need for additional synchronization gearing is eliminated. The NSGA-II genetic algorithm was then applied to the gear generation algorithm in modeFRONTIER, a commercial software that integrates multi-objective optimization with third-party engineering software. A clear Pareto front was identified, and a multi-criteria decision-making genetic algorithm was used to select three optimal designs with varying priorities of compactness vs low flow variation. In addition, three pumps used in industry were scaled and evaluated with the gear generation algorithm for comparison. The scaled industry pumps were all close to the Pareto curve, but the optimized designs offer a slight kinematic advantage, which demonstrates the usefulness of the proposed gerotor design method.

Multi-Objective Optimization of a 2-DoF Purely Translational Parallel Manipulator

2011 ◽  
Vol 317-319 ◽  
pp. 794-798
Author(s):  
Zhi Bin Li ◽  
Yun Jiang Lou ◽  
Yong Sheng Zhang ◽  
Ze Xiang Li
Keyword(s):  
Genetic Algorithm ◽  
Kinematic Analysis ◽  
Parallel Manipulator ◽  
Pareto Front ◽  
Parallel Robot ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Evolution Algorithm

The paper addresses the multi-objective optimization of a 2-DoF purely translational parallel manipulator. The kinematic analysis of the Proposed T2 parallel robot is introduced briefly. The objective functions are optimized simultaneously to improve Regular workspace Share (RWS) and Global Conditioning Index (GCI). A Multi-Objective Evolution Algorithm (MOEA) based on the Control Elitist Non-dominated Sorting Genetic Algorithm (controlled ENSGA-II) is used to find the Pareto front. The optimization results show that this method is efficient. The parallel manipulator prototype is also exhibited here.

scholarly journals Comparison of Planar Parallel Manipulator Architectures Based on a Multi-Objective Design Optimization Approach

2010 ◽  
Author(s):  
Damien Chablat ◽  
Ste´phane Caro ◽  
Raza Ur-Rehman ◽  
Philippe Wenger
Keyword(s):  
Genetic Algorithm ◽  
Design Optimization ◽  
Parallel Manipulator ◽  
Optimization Problem ◽  
Optimization Approach ◽  
Objective Functions ◽  
Multi Objective ◽  
Planar Parallel Manipulator ◽  
Moving Platform ◽  
Pareto Frontiers

This paper deals with the comparison of planar parallel manipulator architectures based on a multi-objective design optimization approach. The manipulator architectures are compared with regard to their mass in motion and their regular workspace size, i.e., the objective functions. The optimization problem is subject to constraints on the manipulator dexterity and stiffness. For a given external wrench, the displacements of the moving platform have to be smaller than given values throughout the obtained maximum regular dexterous workspace. The contributions of the paper are highlighted with the study of 3-PRR, 3-RPR and 3-RRR planar parallel manipulator architectures, which are compared by means of their Pareto frontiers obtained with a genetic algorithm.

scholarly journals Genetic Algorithm Based Solution of Fuzzy Multi-Objective Transportation Problem

2020 ◽  
Vol 5 (6) ◽  
pp. 1452-1467
Author(s):  
Jaydeepkumar M. Sosa ◽  
Jayesh M. Dhodiya
Keyword(s):  
Genetic Algorithm ◽  
Transportation Problem ◽  
Shape Parameter ◽  
Optimization Problems ◽  
Decision Makers ◽  
Objective Functions ◽  
Full Data ◽  
Multi Objective ◽  
Life Problems ◽  
Modern Era

Optimizing problems in the modern era, the single objective optimization problems are insufficient to hold the full data of the problem. Therefore, multi-objective optimization problems come to the rescue. Similarly, in daily life problems, the parameters used in the optimization problem are not always fixed but there may be some uncertainty and it can characterize by fuzzy number. This work underlines the genetic algorithm (GA) based solution of fuzzy transportation problem with more than one objective. With a view to providing the multifaceted choices to decision-maker (DM), the exponential membership function is used with the decision-makers desired number of cases which consisted of shape parameter and aspiration level. Here, we consider the objective functions which are non-commensurable and conflict with each other. To interpret, evaluate and exhibit the usefulness of the proposed method, a numerical example is given.

scholarly journals A new model for logistic and transportation of fashion goods in the presence of stochastic market demands considering restricted retailers capacity

2019 ◽  
Author(s):  
Aidin Delgoshaei ◽  
Hengameh Norozi ◽  
Abolfazl Mirzazadeh ◽  
Maryam Farhadi ◽  
Golnaz Hooshmand Pakdel ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Case Studies ◽  
Programming Model ◽  
Real Data ◽  
Objective Functions ◽  
Mathematical Programming Model ◽  
Multi Objective ◽  
Scheduling Method ◽  
Stochastic Market

In today’s world, using fashion goods is a vital of human. In this research, we focused on developing a scheduling method for distributing and selling fashion goods in a multi-market/multi-retailer supply chain while the product demands in markets are stochastic. For this purpose, a new multi-objective mathematical programming model is developed where maximizing the profit of selling fashion goods and minimizing delivering time and customer’s dissatisfaction are considered as objective functions. In continue due to the complexity of the problem, a number of metaheuristics are compared and a hybrid of Non-dominated Sorting Genetic Algorithm II (NSGAII) and simulated annealing is selected for solving the case studies. Then, in order to find the best values for input parameters of the algorithm, a Taguchi method is applied. In continue, a number of case studies are selected from literature review and solved by the algorithm. The outcomes are analyzed and it is found that using multi-objective models can find more realistic solutions. Then, the model is applied for a case study with real data from industry and outcomes showed that the proposed algorithm can be successfully applied in practice.

scholarly journals NSGA-II algorithm and application for multi-objective flexible workshop scheduling

2020 ◽  
Vol 14 ◽  
pp. 174830262094246
Author(s):  
Wang Yahui ◽  
Shi Ling ◽  
Zhang Cai ◽  
Fu Liuqiang ◽  
Jin Xiangjie
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Optimal Solution ◽  
Scheduling Problem ◽  
Objective Functions ◽  
Nsga Ii ◽  
Industrial Processing ◽  
Multi Objective ◽  
Processing Cost

Based on the study of multi-objective flexible workshop scheduling problem and the learning of traditional genetic algorithm, a non-dominated sorting genetic algorithm is proposed to solve and optimize the scheduling model with the objective functions of processing cycle, advance/delay penalty and processing cost. In the process of optimization, non-dominated fast ranking operator and competition operator are used to select the descendant operator, which improves the computational efficiency and optimization ability of the algorithm. Non-repetitive non-dominant solutions and frontier sets are found in the iteration operation to retain the optimal results. Finally, taking a manufacturing workshop as an example, the practicability of the proposed algorithm is verified by the simulation operation of the workshop scheduling information and the comparison with other algorithms. The results show that the algorithm can obtain the optimal solution more quickly than the unimproved algorithm. The improved algorithm is faster and more effective in searching, and has certain feasibility in solving the job shop scheduling problem, which is more suitable for industrial processing and production.

scholarly journals MULTI-OBJECTIVE OPTIMIZATION OF REINFORCED CONCRETE FRAMES USING NSGA-II ALGORITHM

2016 ◽  
Vol 8 (4) ◽  
pp. 157-164 ◽  
Author(s):  
Mehdi Babaei ◽  
Masoud Mollayi
Keyword(s):  
Genetic Algorithm ◽  
Reinforced Concrete ◽  
Steel Structures ◽  
American Concrete Institute ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Multi Objective ◽  
Design Variables ◽  
Pareto Fronts

In recent decades, the use of genetic algorithm (GA) for optimization of structures has been highly attractive in the study of concrete and steel structures aiming at weight optimization. However, it has been challenging for multi-objective optimization to determine the trade-off between objective functions and to obtain the Pareto-front for reinforced concrete (RC) and steel structures. Among different methods introduced for multi-objective optimization based on genetic algorithms, Non-Dominated Sorting Genetic Algorithm II (NSGA II) is one of the most popular algorithms. In this paper, multi-objective optimization of RC moment resisting frame structures considering two objective functions of cost and displacement are introduced and examined. Three design models are optimized using the NSGA-II algorithm. Evaluation of optimal solutions and the algorithm process are discussed in details. Sections of beams and columns are considered as design variables and the specifications of the American Concrete Institute (ACI) are employed as the design constraints. Pareto-fronts for the objective space have been obtained for RC frame models of four, eight and twelve floors. The results indicate smooth Pareto-fronts and prove the speed and accuracy of the method.

Sign in / Sign up

Export Citation Format

Share Document