Hybrid Model of Genetic Algorithm and Cultural Algorithms for Optimization Problem

2006 ◽  
pp. 441-448 ◽  
Author(s):  
Fang Gao ◽  
Hongwei Liu ◽  
Qiang Zhao ◽  
Gang Cui
Keyword(s):  
Genetic Algorithm ◽  
Hybrid Model ◽  
Optimization Problem ◽  
Cultural Algorithms

scholarly journals The Use of a Simulation Model for High-Runner Strategy Implementation in Warehouse Logistics

2020 ◽  
Vol 12 (23) ◽  
pp. 9818
Author(s):  
Gabriel Fedorko ◽  
Vieroslav Molnár ◽  
Nikoleta Mikušová
Keyword(s):  
Genetic Algorithm ◽  
Simulation Model ◽  
Optimization Problem ◽  
Software Tool ◽  
Time Saving ◽  
General Validity ◽  
Resistance Function ◽  
Genetic Algorithm Method ◽  
Working Day ◽  
Enterprise Logistics

This paper examines the use of computer simulation methods to streamline the process of picking materials within warehouse logistics. The article describes the use of a genetic algorithm to optimize the storage of materials in shelving positions, in accordance with the method of High-Runner Strategy. The goal is to minimize the time needed for picking. The presented procedure enables the creation of a software tool in the form of an optimization model that can be used for the needs of the optimization of warehouse logistics processes within various types of production processes. There is a defined optimization problem in the form of a resistance function, which is of general validity. The optimization is represented using the example of 400 types of material items in 34 categories, stored in six rack rows. Using a simulation model, a comparison of a normal and an optimized state is realized, while a time saving of 48 min 36 s is achieved. The mentioned saving was achieved within one working day. However, the application of an approach based on the use of optimization using a genetic algorithm is not limited by the number of material items or the number of categories and shelves. The acquired knowledge demonstrates the application possibilities of the genetic algorithm method, even for the lowest levels of enterprise logistics, where the application of this approach is not yet a matter of course but, rather, a rarity.

scholarly journals An Improved MOEA/D Based on Reference Distance for Software Project Portfolio Optimization

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jing Xiao ◽  
Jing-Jing Li ◽  
Xi-Xi Hong ◽  
Min-Mei Huang ◽  
Xiao-Min Hu ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithms ◽  
Portfolio Optimization ◽  
Optimization Problem ◽  
Experimental Comparison ◽  
Software Project ◽  
Project Portfolio ◽  
Multiobjective Evolutionary Algorithms ◽  
Reference Distance ◽  
Nondominated Sorting

As it is becoming extremely competitive in software industry, large software companies have to select their project portfolio to gain maximum return with limited resources under many constraints. Project portfolio optimization using multiobjective evolutionary algorithms is promising because they can provide solutions on the Pareto-optimal front that are difficult to be obtained by manual approaches. In this paper, we propose an improved MOEA/D (multiobjective evolutionary algorithm based on decomposition) based on reference distance (MOEA/D_RD) to solve the software project portfolio optimization problems with optimizing 2, 3, and 4 objectives. MOEA/D_RD replaces solutions based on reference distance during evolution process. Experimental comparison and analysis are performed among MOEA/D_RD and several state-of-the-art multiobjective evolutionary algorithms, that is, MOEA/D, nondominated sorting genetic algorithm II (NSGA2), and nondominated sorting genetic algorithm III (NSGA3). The results show that MOEA/D_RD and NSGA2 can solve the software project portfolio optimization problem more effectively. For 4-objective optimization problem, MOEA/D_RD is the most efficient algorithm compared with MOEA/D, NSGA2, and NSGA3 in terms of coverage, distribution, and stability of solutions.

ONE IMPROVED AGENT GENETIC ALGORITHM — RING-LIKE AGENT GENETIC ALGORITHM FOR GLOBAL NUMERICAL OPTIMIZATION

2009 ◽  
Vol 26 (04) ◽  
pp. 479-502 ◽  
Author(s):  
BIN LIU ◽  
TEQI DUAN ◽  
YONGMING LI
Keyword(s):  
Genetic Algorithm ◽  
Numerical Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Genetic Operators ◽  
Global Numerical Optimization ◽  
Candidate Solution ◽  
Low Dimension ◽  
Multi Agent ◽  
Agent Structure

In this paper, a novel genetic algorithm — dynamic ring-like agent genetic algorithm (RAGA) is proposed for solving global numerical optimization problem. The RAGA combines the ring-like agent structure and dynamic neighboring genetic operators together to get better optimization capability. An agent in ring-like agent structure represents a candidate solution to the optimization problem. Any agent interacts with neighboring agents to evolve. With dynamic neighboring genetic operators, they compete and cooperate with their neighbors, and they can also use knowledge to increase energies. Global numerical optimization problems are the most important ones to verify the performance of evolutionary algorithm, especially of genetic algorithm and are mostly of interest to the corresponding researchers. In the corresponding experiments, several complex benchmark functions were used for optimization, several popular GAs were used for comparison. In order to better compare two agents GAs (MAGA: multi-agent genetic algorithm and RAGA), the several dimensional experiments (from low dimension to high dimension) were done. These experimental results show that RAGA not only is suitable for optimization problems, but also has more precise and more stable optimization results.

scholarly journals Research and Application of a New Hybrid Forecasting Model Based on Genetic Algorithm Optimization: A Case Study of Shandong Wind Farm in China

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Ping Jiang ◽  
Xiaofei Li ◽  
Yao Dong
Keyword(s):  
Genetic Algorithm ◽  
Wind Speed ◽  
Hybrid Model ◽  
Hybrid System ◽  
Wind Farm ◽  
Evaluation Criteria ◽  
Renewable Resource ◽  
Original Data ◽  
Determine Parameter ◽  
Forecasting Method

With the increasing depletion of fossil fuel and serious destruction of environment, wind power, as a kind of clean and renewable resource, is more and more connected to the power system and plays a crucial role in power dispatch of hybrid system. Thus, it is necessary to forecast wind speed accurately for the operation of wind farm in hybrid system. In this paper, we propose a hybrid model called EEMD-GA-FAC/SAC to forecast wind speed. First, the Ensemble empirical mode decomposition (EEMD) can be applied to eliminate the noise of the original data. After data preprocessing, first-order adaptive coefficient forecasting method (FAC) or second-order adaptive coefficient forecasting method (SAC) can be employed to do forecast. It is significant to select optimal parameters for an effective model. Thus, genetic algorithm (GA) is used to determine parameter of the hybrid model. In order to verify the validity of the proposed model, every ten-minute wind speed data from three observation sites in Shandong Peninsula of China and several error evaluation criteria can be collected. Through comparing with traditional BP, ARIMA, FAC, and SAC model, the experimental results show that the proposed hybrid model EEMD-GA-FAC/SAC has the best forecasting performance.

Optimal Placement of Horizontal- and Vertical-Axis Wind Turbines in a Wind Farm for Maximum Power Generation Using a Genetic Algorithm

2011 ◽  
Author(s):  
Xiaomin Chen ◽  
Ramesh Agarwal
Keyword(s):  
Genetic Algorithm ◽  
Wind Turbines ◽  
Wind Farm ◽  
Optimization Problem ◽  
Vertical Axis ◽  
Optimal Placement ◽  
Vertical Axis Wind Turbines ◽  
Wake Effects ◽  
Horizontal Axis Wind Turbines ◽  
Wake Model

In this paper, we consider the Wind Farm layout optimization problem using a genetic algorithm. Both the Horizontal–Axis Wind Turbines (HAWT) and Vertical-Axis Wind Turbines (VAWT) are considered. The goal of the optimization problem is to optimally place the turbines within the wind farm such that the wake effects are minimized and the power production is maximized. The reasonably accurate modeling of the turbine wake is critical in determination of the optimal layout of the turbines and the power generated. For HAWT, two wake models are considered; both are found to give similar answers. For VAWT, a very simple wake model is employed.

Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm

2021 ◽  
Author(s):  
Ovidiu Cosma ◽  
Petrică C Pop ◽  
Cosmin Sabo
Keyword(s):  
Genetic Algorithm ◽  
Supply Chain ◽  
Network Design ◽  
Design Problem ◽  
Optimization Problem ◽  
Hybrid Genetic Algorithm ◽  
Network Design Problem ◽  
Supply Chain Network Design ◽  
Supply Chain Network ◽  
Fixed Costs

Abstract In this paper we investigate a particular two-stage supply chain network design problem with fixed costs. In order to solve this complex optimization problem, we propose an efficient hybrid algorithm, which was obtained by incorporating a linear programming optimization problem within the framework of a genetic algorithm. In addition, we integrated within our proposed algorithm a powerful local search procedure able to perform a fine tuning of the global search. We evaluate our proposed solution approach on a set of large size instances. The achieved computational results prove the efficiency of our hybrid genetic algorithm in providing high-quality solutions within reasonable running-times and its superiority against other existing methods from the literature.

scholarly journals A Hybrid Model for Bankruptcy prediction Using Genetic Algorithm,Fuzzy C-Means and Mars

2011 ◽  
Vol 2 (1) ◽  
pp. 12-24 ◽  
Author(s):  
A Martin ◽  
V Gayathri ◽  
G Saranya ◽  
P Gayathri ◽  
Prasanna Venkatesan
Keyword(s):  
Genetic Algorithm ◽  
Hybrid Model ◽  
Bankruptcy Prediction ◽  
Fuzzy C Means
Sign in / Sign up

Export Citation Format

Share Document