scholarly journals Economic Analysis of Lagrangian and Genetic Algorithm for the Optimal Capacity Planning of Photovoltaic Generation

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Jeeng-Min Ling ◽  
Ping-Hsun Liu
Keyword(s):  
Genetic Algorithm ◽  
Capacity Planning ◽  
Optimal Allocation ◽  
Optimization Problems ◽  
Optimization Technique ◽  
Global Optimum ◽  
Probability Method ◽  
Optimal Capacity ◽  
Nonlinear Features ◽  
The Cost

The optimal allocation problem for a stand-alone photovoltaic (SPV) generation can be achieved by good compromise between system objective and constraint requirements. The Lagrange technique (LGT) is a traditional method to solve such constrained optimization problem. To consider the nonlinear features of reliability constraints evolving from the consideration of different scenarios, including variations of component cost, load profile and installation location, the implementation of SPV generation planning is time-consuming and conventionally implemented by a probability method. Genetic Algorithm (GA) has been successfully applied to many optimization problems. For the optimal allocation of photovoltaic and battery devices, the cost function minimization is implemented by GA to attain global optimum with relative computation simplicity. Analytical comparisons between the results from LGT and GA were investigated and the performance of simulation was discussed. Different planning scenarios show that GA performs better than the Lagrange optimization technique.

Optimization Study of a Hybrid Solar Air Conditioner

2013 ◽  
Author(s):  
Ali Al-Alili ◽  
Yunho Hwang ◽  
Reinhard Radermacher
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problems ◽  
Global Optimum ◽  
Optimized Design ◽  
Air Conditioner ◽  
Air Conditioners ◽  
Multi Objective Genetic Algorithm ◽  
Design Variables ◽  
Optimization Study ◽  
Systems Simulation

In order for the solar air conditioners (A/Cs) to become a real alternative to the conventional systems, their performance and total cost has to be optimized. In this study, an innovative hybrid solar A/C was simulated using the transient systems simulation (TRNSYS) program, which was coupled with MATLAB in order to carry out the optimization study. Two optimization problems were formulated with the following design variables: collector area, collector mass flow rate, storage tank volume, and number of batteries. The Genetic Algorithm (GA) was selected to find the global optimum design for the lowest electrical consumption. To optimize the two objective functions simultaneously, a Multi-Objective Genetic Algorithm (MOGA) was used to find the Pareto front within the design variables’ bounds while satisfying the constraints. The optimized design was also compared to a standard vapor compression cycle. The results show that coupling TRNSYS and MATLAB expands TRNSYS optimization capability in solving more complicated optimization problems.

Optimization of Contact Problem by Genetic Algorithm Method

2011 ◽  
Vol 105-107 ◽  
pp. 386-391 ◽  
Author(s):  
Jan Szweda ◽  
Zdenek Poruba
Keyword(s):  
Genetic Algorithm ◽  
Contact Problem ◽  
Shape Optimization ◽  
Optimization Problem ◽  
Optimization Technique ◽  
Contact Problems ◽  
Global Optimum ◽  
Genetic Algorithm Method ◽  
Characteristic Features ◽  
Contact Shape

In this paper is discussed the way of suitable numerical solution of contact shape optimization problem. The first part of the paper is focused on method of global optimization field among which the genetic algorithm is chosen for computer processing and for application on contact problem optimization. The brief description of this method is done with emphasis of its characteristic features. The experiment performed on plane structural problem validates the ability of genetic algorithm in search the area of the global optimum. On the base of the research described in this work, it is possible to recommend optimization technique of genetic algorithm to use for shape optimization of engineering contact problems in which it is possible for any shape to achieve successful convergence of contact task solution.

Optimal Setpoints for HVAC Systems via Iterative Cooperative Neighbor Communication

2014 ◽  
Vol 137 (1) ◽  
Author(s):  
Matthew Elliott ◽  
Bryan P. Rasmussen
Keyword(s):  
Energy Savings ◽  
Optimization Technique ◽  
Optimal Solution ◽  
Hvac Systems ◽  
Global Optimum ◽  
Cost Information ◽  
Steady State Condition ◽  
Air Conditioning Systems ◽  
The Cost ◽  
Dynamic Subsystem

Heating, ventilation, and air conditioning systems in large buildings frequently feature a network topology wherein the outputs of each dynamic subsystem act as disturbances to other subsystems. The distributed optimization technique presented in this paper leverages this topology without requiring a centralized controller or widespread knowledge of the interaction dynamics between subsystems. Each subsystem's controller calculates an optimal steady state condition. The output corresponding to this condition is then communicated to downstream neighbors only. Similarly, each subsystem communicates to its upstream neighbors the predicted costs imposed by the neighbors' own calculated outputs. By judicious construction of the cost functions, all of the cost information is propagated through the network, allowing a Pareto optimal solution to be reached. The novelty of this approach is that communication between all plants is not necessary to achieve a global optimum. Since each optimizer does not require knowledge of its neighbors' dynamics, changes in one controller do not require changes to all controllers in the network. Proofs of convergence to Pareto optimality under certain conditions are presented, and convergence under the approach is demonstrated with a simulation example. The approach is also applied to a laboratory-based water chiller system; several experiments demonstrate the features of the approach and potential for energy savings.

Solar Hybrid Air Conditioner: Model Validation and Optimization

2016 ◽  
Vol 138 (3) ◽  
Author(s):  
Ali Al-Alili ◽  
Yunho Hwang ◽  
Reinhard Radermacher
Keyword(s):  
Genetic Algorithm ◽  
Energy Storage ◽  
Solar Collector ◽  
Optimization Problems ◽  
Electrical Energy ◽  
Global Optimum ◽  
Air Conditioner ◽  
Solar Thermal Energy ◽  
Design Variables ◽  
Optimization Study

Solar air conditioners (A/Cs) have attracted much attention in research, but their performance and cost have to be optimized in order to become a real alternative to conventional A/C systems. In this study, a hybrid solar A/C is simulated using the transient systems simulation program(trnsys), which is coupled with matlab in order to carry out the optimization study. The trnsys model is experimentally validated prior to the optimization study. Two optimization problems are formulated with the following design variables: solar collector area, solar collector mass flow rate, solar thermal energy storage volume, and solar electrical energy storage size. The genetic algorithm (GA) is selected to solve the single-objective optimization problem and find the global optimum design for the lowest electrical consumption. To optimize the two objective functions simultaneously, energy consumption and total cost (TC), a multi-objective genetic algorithm (MOGA) is used to find the Pareto curve within the design variables' bounds while satisfying the constraints. The overall cost of the optimized solar A/C design is also compared to a standard vapor compression cycle (VCC). The results show that coupling trnsys and matlab expands trnsys optimization capability in solving more complex optimization problems. The results also show that the optimized solar hybrid A/C is not very competitive when the electricity prices are low and no governmental support is provided.

OPTIMAL TESTING RESOURCE ALLOCATION FOR MODULAR SOFTWARE CONSIDERING COST, TESTING EFFORT AND RELIABILITY USING GENETIC ALGORITHM

2009 ◽  
Vol 16 (06) ◽  
pp. 495-508 ◽  
Author(s):  
P. K. KAPUR ◽  
ANU. G. AGGARWAL ◽  
KANICA KAPOOR ◽  
GURJEET KAUR
Keyword(s):  
Genetic Algorithm ◽  
Resource Allocation ◽  
Software Development ◽  
Large Scale ◽  
Optimization Problems ◽  
Low Cost ◽  
Computer Software ◽  
Critical Issue ◽  
Software Systems ◽  
The Cost

The demand for complex and large-scale software systems is increasing rapidly. Therefore, the development of high-quality, reliable and low cost computer software has become critical issue in the enormous worldwide computer technology market. For developing these large and complex software small and independent modules are integrated which are tested independently during module testing phase of software development. In the process, testing resources such as time, testing personnel etc. are used. These resources are not infinitely large. Consequently, it is an important matter for the project manager to allocate these limited resources among the modules optimally during the testing process. Another major concern in software development is the cost. It is in fact, profit to the management if the cost of the software is less while meeting the costumer requirements. In this paper, we investigate an optimal resource allocation problem of minimizing the cost of software testing under limited amount of available resources, given a reliability constraint. To solve the optimization problem we present genetic algorithm which stands up as a powerful tool for solving search and optimization problems. The key objective of using genetic algorithm in the field of software reliability is its capability to give optimal results through learning from historical data. One numerical example has been discussed to illustrate the applicability of the approach.

scholarly journals Solving a multicriteria scheduling problem using a genetic algorithm

2021 ◽  
Vol 5 (1) ◽  
pp. 100-106
Author(s):  
Alina Kazmirchuk ◽  
Olena Zhdanova ◽  
Volodymyr Popenko ◽  
Maiia Sperkach
Keyword(s):  
Genetic Algorithm ◽  
Multicriteria Optimization ◽  
Work Performance ◽  
Optimal Allocation ◽  
Optimization Problems ◽  
Scheduling Problem ◽  
Pareto Solutions ◽  
Advantages And Disadvantages ◽  
Multicriteria Scheduling ◽  
Multiobjective Optimization Problems

The work is devoted to the multiobjective task of scheduling, in which a given set of works must be performed by several performers of different productivity. A certain number of bonuses is accrued for the work performed by the respective executor, which depends on the time of work performance. The criteria for evaluating the schedule are the total time of all jobs and the amount of bonuses spent. In the research the main approaches to solving multiobjective optimization problems were analyzed, based on which the Pareto approach was chosen. The genetic algorithm was chosen as the algorithm. The purpose of this work is to increase the efficiency of solving multicriteria optimization problems by implementing a heuristic algorithm and increase its speed. The tasks of the work are to determine the advantages and disadvantages of the approaches used to solve multicriteria optimization problems, to develop a genetic algorithm for solving the multicriteria scheduling problem and to study its efficiency. Operators of the genetic algorithm have been developed, which take into account the peculiarities of the researched problem and allow to obtain Pareto solutions in the process of work. Due to the introduction of parallel calculations in the implementation of the genetic algorithm, it was possible to increase its speed compared to the conventional version. The developed algorithm can be used in solving the problem of optimal allocation of resources, which is part of the system of accrual of bonuses to employees.

scholarly journals Genetic Algorithm – A Sensible Evolutionary Optimization Technique

2019 ◽  
Vol 8 (9) ◽  
pp. 2805-2809
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Random Search ◽  
Optimization Technique ◽  
Search Space ◽  
Effective Population ◽  
Natural Systems ◽  
Heuristic Search Algorithm ◽  
Feasible Solutions

The study presents a pragmatic outlook of genetic algorithm. Many biological algorithms are inspired for their ability to evolve towards best solutions and of all; genetic algorithm is widely accepted as they well suit evolutionary computing models. Genetic algorithm could generate optimal solutions on random as well as deterministic problems. Genetic algorithm is a mathematical approach to imitate the processes studied in natural evolution. The methodology of genetic algorithm is intensively experimented in order to use the power of evolution to solve optimization problems. Genetic algorithm is an adaptive heuristic search algorithm based on the evolutionary ideas of genetics and natural selection. Genetic algorithm exploits random search approach to solve optimization problems. Genetic algorithm takes benefits of historical information to direct the search into the convergence of better performance within the search space. The basic techniques of evolutionary algorithms are observed to be simulating the processes in natural systems. These techniques are aimed to carry effective population to the next generation and ensure the survival of the fittest. Nature supports the domination of stronger over the weaker ones in any kind. In this study, we proposed the arithmetic views of the behavior and operators of genetic algorithm that support the evolution of feasible solutions to optimized solutions.

scholarly journals Optimal Integration of the Renewable Energy to the Grid by Considering Small Signal Stability Constraint

2017 ◽  
Vol 7 (5) ◽  
pp. 2329
Author(s):  
I Made Wartana ◽  
Ni Putu Agustini ◽  
Jai Govind Singh
Keyword(s):  
Genetic Algorithm ◽  
Renewable Energy ◽  
Wind Turbine ◽  
Optimal Allocation ◽  
Optimization Problems ◽  
Small Signal ◽  
Small Signal Stability ◽  
Nsga Ii ◽  
Signal Stability ◽  
Optimal Integration

In recent decades, one of the main management’s concerns of professional engineers is the optimal integration of various types of renewable energy to the grid. This paper discusses the optimal allocation of one type of renewable energy i.e. wind turbine to the grid for enhancing network’s performance. A multi-objective function is used as indexes of the system’s performance, such as increasing system loadability and minimizing the loss of real power transmission line by considering security and stability of systems’ constraints viz.: voltage and line margins, and eigenvalues as well which is representing as small signal stability. To solve the optimization problems, a new method has been developed using a novel variant of the Genetic Algorithm (GA), specifically known as Non-dominated Sorting Genetic Algorithm II (NSGA-II). Whereas the Fuzzy-based mechanism is used to support the decision makers prefer the best compromise solution from the Pareto front. The effectiveness of the developed method has been established on a modified IEEE 14-bus system with wind turbine system, and their simulation results showed that the dynamic performance of the power system can be effectively improved by considering the stability and security of the system.

RDF Query Path Optimization Using Hybrid Genetic Algorithms

2022 ◽  
Vol 12 (1) ◽  
pp. 1-16
Author(s):  
Qazi Mudassar Ilyas ◽  
Muneer Ahmad ◽  
Sonia Rauf ◽  
Danish Irfan
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Execution Time ◽  
Optimization Problems ◽  
Hybrid Genetic Algorithm ◽  
Solution Space ◽  
Path Optimization ◽  
Initial Population ◽  
Description Framework ◽  
The Cost

Resource Description Framework (RDF) inherently supports data mergers from various resources into a single federated graph that can become very large even for an application of modest size. This results in severe performance degradation in the execution of RDF queries. As every RDF query essentially traverses a graph to find the output of the Query, an efficient path traversal reduces the execution time of RDF queries. Hence, query path optimization is required to reduce the execution time as well as the cost of a query. Query path optimization is an NP-hard problem that cannot be solved in polynomial time. Genetic algorithms have proven to be very useful in optimization problems. We propose a hybrid genetic algorithm for query path optimization. The proposed algorithm selects an initial population using iterative improvement thus reducing the initial solution space for the genetic algorithm. The proposed algorithm makes significant improvements in the overall performance. We show that the overall number of joins for complex queries is reduced considerably, resulting in reduced cost.

Optimizing Society

2011 ◽  
pp. 450-468
Author(s):  
Martin Macaš ◽  
Lenka Lhotská
Keyword(s):  
Social Psychology ◽  
Genetic Algorithm ◽  
Social Impact ◽  
Formal Analysis ◽  
Optimization Technique ◽  
Global Optimum ◽  
Particle Swarm Optimizer ◽  
Binary Optimization ◽  
Candidate Solution ◽  
Impact Theory

A novel binary optimization technique is introduced called Social Impact Theory based Optimizer (SITO), which is based on social psychology model of social interactions. The algorithm is based on society of individuals. Each individual holds a set of its attitudes, which encodes a candidate solution of a binary optimization problem. Individuals change their attitudes according to their spatial neighbors and their fitness, which leads to convergence to local (or global) optimum. This chapter also tries to demonstrate different aspects of the SITO’s behavior and to give some suggestions for potential user. Further, a comparison to similar techniques – genetic algorithm and binary particle swarm optimizer – is discussed and some possibilities of formal analysis are briefly presented.

Sign in / Sign up

Export Citation Format

Share Document