Efficient Genetic Algorithm sets for optimizing constrained building design problem

The main aim of this paper is to find the appropriate set of Genetic Algorithm (GA), control parameters that attain the optimum, or near optimum solutions, in a reasonable computational time for constrained building optimization problem. Eight different combinations of control parameters of binary coded GA were tested in a hypothetical building problem by changing 80 variables. The results showed that GA performance was insensitive to some GA control parameter values such as crossover probability and mutation rate. However, population size was the most influential control parameter on the GA performance. In particular, the population sizes (15 individuals) require less computational time to reach the optimum solution. In particular, a binary encoded GA with relatively small population sizes can be used to solve constrained building optimization problems within 750 building simulation calls

Genetically Generated Neural Networks I: Representational Effects

This paper studies several applications of genetic algorithms (GAs) within the neural networks field. After generating a robust GA engine, the system was used to generate neural network circuit architectures. This was accomplished by using the GA to determine the weights in a fully interconnected network. The importance of the internal genetic representation was shown by testing different approaches. The effects in speed of optimization of varying the constraints imposed upon the desired network were also studied. It was observed that relatively loose constraints provided results comparable to a fully constrained system. The type of neural network circuits generated were recurrent competitive fields as described by Grossberg (1982)

Optimal Pairings Selection From Flight Schedule Using Genetic Algorithm And Particle Swarm Optimization With Penalty

Indonesia is a large archipelago country with large population so that the demands of flight service are very high. Because the demands of flight service, flight industry should minimize operational cost such as crew cost. Crew cost depends on pairings from flight schedule. Optimization model of this problem is selecting optimal pairings covering all flight numbers. In this research, optimal pairings selection will be applied by heuristic method like Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) with penalty. GA uses natural selection process mechanism in chromosomes whille PSO is optimization method inspired from the flock of fish or bird in searching food source. Both GA and PSO can be applied on constrained optimization. In order that satisfying constraints, chromosome in GA or particle in PSO will be given penalty if the constraint isn't satisfied. Simulations are applied by generating the set of pairings and selection using GA and PSO with penalty. Simulation result shows GA and PSO method with penalty can select optimal pairings in approachin

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

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

Design Optimization of High-Frequency Power Transformer by Genetic Algorithm and Simulated Annealing

This paper highlights the transformer design optimization problem. The objective of transformer design optimization problem requires minimizing the total mass (or cost) of the core and wire material by satisfying constraints imposed by international standards and transformer user specification. The constraints include appropriate limits on efficiency, voltage regulation, temperature rise, no-load current and winding fill factor. The design optimizations seek a constrained minimum mass (or cost) solution by optimally setting the transformer geometry parameters and require magnetic properties. This paper shows the above design problems can be formulated in genetic algorithm(GA) and simulated annealing (SA) format. The importance of the GA and SA format stems for two main features. First it provides efficient and reliable solution for the design optimization problem with several variables. Second, it guaranteed that the obtained solution is global optimum. This paper includes a demonstration of the application of the GP technique to transformer design.Key word—Optimization, Power Transformer, Genetic Algorithm (GA), Simulated Annealing Technique (SA)DOI:http://dx.doi.org/10.11591/ijece.v1i2.8

A Constraint Handling Strategy for Bit-Array Representation GA in Structural Topology Optimization

In this study, an improved bit-array representation method for structural topology optimization using the Genetic Algorithm (GA) is proposed. The issue of representation degeneracy is fully addressed and the importance of structural connectivity in a design is further emphasized. To evaluate the constrained objective function, Deb's constraint handling approach is further developed to ensure that feasible individuals are always better than infeasible ones in the population to improve the efficiency of the GA. A hierarchical violation penalty method is proposed to drive the GA search towards the topologies with higher structural performance, less unusable material and fewer separate objects in the design domain in a hierarchical manner. Numerical results of structural topology optimization problems of minimum weight and minimum compliance designs show the success of this novel bit-array representation method and suggest that the GA performance can be significantly improved by handling the design connectivity properly.Singapore-MIT Alliance (SMA

Multiple constrained sizing-shaping truss-optimization using ANGEL method

The aim of this study to demonstrate that the previously developed ANGEL algorithm can be efficiently used for multiple constrained sizing-shaping truss optimization problems. The applied hybrid method ANGEL, which was originally developed for simple truss optimization problems combines ant colony optimization (ACO), genetic algorithm (GA), and local search strategy (LS). ACO and GA search alternately and cooperatively in the solution space. In ANGEL, the traditional stochastic mutation operator is replaced by the local search procedure as a deterministic counterpart of the stochastic mutation. The feasibility is measured by the maximal load intensity factor computed by a third order path-following method. The powerful LS algorithm, which is based on the local linearization of the set of the constraints and the objective function, is applied to yield a better feasible or less unfeasible solution when ACO or GA obtains a solution. In order to demonstrate the efficiency of ANGEL in the given application area, a well-known example is presented under multiple constraints

Multiobjective optimization of a cable-driven robot for wrist rehabilitation using a genetic algorithm

This paper presents a multi-objective optimization using a genetic algorithm to reduce the size of the current configuration of a cable-driven end-effector robot for wrist rehabilitation. The objective of this work is to obtain a smaller robot with good performance by employing a constrained genetic algorithm (GA) so the device can be light and wearable. The optimization was performed to study the effect of the robot dimensions and in the end, a new solution that can reduce the robot size by 35% and increase the performance by 1.8% was found

Solving constrained optimization problems with sine-cosine algorithm

Optimization algorithms aim to find the optimum values that give the maximum or minimum result of a function under given circumstance. There are many approaches to solve optimization problems. Stochastic population-based optimization approaches tend to give the best results in a reasonable time. Two of the state-of-art stochastic optimization algorithms are Genetic Algorithms (GA) and Particle Swarm Optimization(PSO). In addition, Sine-Cosine Algorithm is one of the recently developed stochastic population-based optimization algorithms. It is claimed that Sine-Cosine has a higher speed than the counterparts of it. Moreover, Sine-Cosine Algorithm occasionally outperforms other optimization algorithms including GA and PSO. This algorithm is successful because it can balance exploration and exploitation smoothly. In the previous studies, the above-mentioned algorithms were evaluated and compared to each other for the unconstrained optimization test functions. But there is no study on constrained optimization test problems. In this study, we aim to show the performance of Sine-Cosine Algorithm on constrained optimization problems. In order to achieve this, we are going to compare the performances by using well-known constrained test function

Time-constrained nature-inspired optimization algorithms for an efficient energy management system in smart homes and buildings

This paper proposes two bio-inspired heuristic algorithms, the Moth-Flame Optimization (MFO) algorithm and Genetic Algorithm (GA), for an Energy Management System (EMS) in smart homes and buildings. Their performance in terms of energy cost reduction, minimization of the Peak to Average power Ratio (PAR) and end-user discomfort minimization are analysed and discussed. Then, a hybrid version of GA and MFO, named TG-MFO (Time-constrained Genetic-Moth Flame Optimization), is proposed for achieving the aforementioned objectives. TG-MFO not only hybridizes GA and MFO, but also incorporates time constraints for each appliance to achieve maximum end-user comfort. Different algorithms have been proposed in the literature for energy optimization. However, they have increased end-user frustration in terms of increased waiting time for home appliances to be switched ON. The proposed TG-MFO algorithm is specially designed for nearly-zero end-user discomfort due to scheduling of appliances, keeping in view the timespan of individual appliances. Renewable energy sources and battery storage units are also integrated for achieving maximum end-user benefits. For comparison, five bio-inspired heuristic algorithms, i.e., Genetic Algorithm (GA), Ant Colony Optimization (ACO), Cuckoo Search Algorithm (CSA), Firefly Algorithm (FA) and Moth-Flame Optimization (MFO), are used to achieve the aforementioned objectives in the residential sector in comparison with TG-MFO. The simulations through MATLAB show that our proposed algorithm has reduced the energy cost up to 32.25% for a single user and 49.96% for thirty users in a residential sector compared to unscheduled load