A Genetic Algorithm for the Production Policy in a Supply Chain under Discrete Demand and Time-Vary Cost

2013 ◽  
Vol 321-324 ◽  
pp. 2137-2140 ◽  
Author(s):  
Bing Chang Ouyang
Keyword(s):  
Genetic Algorithm ◽  
Supply Chain ◽  
Fitness Function ◽  
Optimal Solution ◽  
Just In Time ◽  
Adaptive Genetic Algorithm ◽  
Production Policy ◽  
Production Scheme ◽  
Distribution Requirement ◽  
Local Optimal Solution

Considering discrete demand and time-vary unit production cost under a foreseeable time horizon, this study presents an adaptive genetic algorithm to determine the production policy for one manufacturer supplying single item to multiple warehouses in a supply chain environment. Based on Distribution Requirement Planning (DRP) and Just in Time (JIT) delivery policy, we assume each gene in chromosome represents a period. Standard GA operators are used to generate new populations. These populations are evaluated by a fitness function using the total cost of production scheme. An explicit procedure for obtaining the local optimal solution is provided.

An Improved Cloud Adaptive Genetic Algorithm Based on Cloud Computing for Active Optimization Calculation

2015 ◽  
Vol 713-715 ◽  
pp. 1579-1582
Author(s):  
Shao Min Zhang ◽  
Ze Wu ◽  
Bao Yi Wang
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Large Scale ◽  
Optimal Solution ◽  
Adaptive Genetic Algorithm ◽  
Load Optimization ◽  
Active Load ◽  
Optimization Calculation ◽  
Local Optimal Solution ◽  
Optimization Allocation

Under the background of huge amounts of data in large-scale power grid, the active power optimization calculation is easy to fall into local optimal solution, and meanwhile the calculation demands a higher processing speed. Aiming at these questions, the farmer fishing algorithm which is applied to solve the problem of optimal distribution of active load for coal-fired power units is used to improve the cloud adaptive genetic algorithm (CAGA) for speeding up the convergence phase of CAGA. The concept of cloud computing algorithm is introduced, and parallel design has been done through MapReduce graphs. This method speeds up the calculation and improves the effectiveness of the active load optimization allocation calculation.

Satellite Module Layout Design Based on Adaptive Bee Evolutionary Genetic Algorithm

2014 ◽  
Vol 538 ◽  
pp. 193-197
Author(s):  
Jian Jiang Su ◽  
Chao Che ◽  
Qiang Zhang ◽  
Xiao Peng Wei
Keyword(s):  
Genetic Algorithm ◽  
Optimal Solution ◽  
Layout Design ◽  
Adaptive Genetic Algorithm ◽  
Local Optimality ◽  
Mutation Probability ◽  
Evolutionary Genetic ◽  
Local Optimal Solution ◽  
The Moment ◽  
Crossover And Mutation

The main problems for Genetic Algorithm (GA) to deal with the complex layout design of satellite module lie in easily trapping into local optimality and large amount of consuming time. To solve these problems, the Bee Evolutionary Genetic Algorithm (BEGA) and the adaptive genetic algorithm (AGA) are introduced. The crossover operation of BEGA algorithm effectively reinforces the information exploitation of the genetic algorithm, and introducing random individuals in BEGA enhance the exploration capability and avoid the premature convergence of BEGA. These two features enable to accelerate the evolution of the algorithm and maintain excellent solutions. At the same time, AGA is adopted to improve the crossover and mutation probability, which enhances the escaping capability from local optimal solution. Finally, satellite module layout design based on Adaptive Bee Evolutionary Genetic Algorithm (ABEGA) is proposed. Numerical experiments of the satellite module layout optimization show that: ABEGA outperforms SGA and AGA in terms of the overall layout scheme, enveloping circle radius, the moment of inertia and success rate.

scholarly journals Design and Application of Genetic Algorithm Based on Signal Game and Newsboy Model for Optimizing Supply Chain

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Yue Zhao ◽  
Yang Shen ◽  
Jiaqi Yan
Keyword(s):  
Genetic Algorithm ◽  
Supply Chain ◽  
Fitness Function ◽  
Optimal Solution ◽  
Supply Chain Optimization ◽  
Business Decisions ◽  
Efficient Operation ◽  
Maximum Utility ◽  
Newsboy Model ◽  
Decision Making Model

Reasonable communication and cooperation between enterprises are helpful for the efficient operation of a supply chain. To explore the maximum utility of an entire supply chain, we propose a supplier-manufacturer-seller supply-chain game decision-making model. We use the model as the fitness function of a genetic algorithm that calculates the optimal solution and optimizes the total utility parameters. We analyze the theoretical and practical properties of the supply-chain optimization process and implement it in MATLAB, which provides quantitative support and useful references for making business decisions and optimally managing a supply chain.

Research on Nondestructive Image Compression Technology Based on Genetic Algorithm

2012 ◽  
Vol 155-156 ◽  
pp. 789-794
Author(s):  
Jie He ◽  
Hui Guo
Keyword(s):  
Genetic Algorithm ◽  
Fitness Function ◽  
Optimal Solution ◽  
Adaptive Genetic Algorithm ◽  
Coding Method ◽  
Iteration Function ◽  
Block Iteration ◽  
Definition Of ◽  
Adaptive Crossover ◽  
The Individual

Based on nondestructive and block iteration function the characteristics of the system, and put forward a kind of improved the global optimal solution from similar partition adaptive genetic algorithm is proposed. In the algorithm for the father the searching space of the individual pieces by gray coding method; Definition of father and son of minimum error for the match fitness function; Genetic algorithm is put forward the improvement of the linear adaptive crossover and mutation probability; Take excellent protection strategy choice. The experimental results show that this method in the similar image guarantee the quality and the compression ratio decompression also can obviously reduce compressed time, effectively improve the searching efficiency.

scholarly journals The Application of an Adaptive Genetic Algorithm Based on Collision Detection in Path Planning of Mobile Robots

2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Kun Hao ◽  
Jiale Zhao ◽  
Beibei Wang ◽  
Yonglei Liu ◽  
Chuanqi Wang
Keyword(s):  
Genetic Algorithm ◽  
Path Planning ◽  
Collision Detection ◽  
Optimal Solution ◽  
Adaptive Mutation ◽  
Adaptive Genetic Algorithm ◽  
Mutation Operator ◽  
Crossover Operator ◽  
Running Time ◽  
Local Optimal Solution

An adaptive genetic algorithm based on collision detection (AGACD) is proposed to solve the problems of the basic genetic algorithm in the field of path planning, such as low convergence path quality, many iterations required for convergence, and easily falling into the local optimal solution. First, this paper introduces the Delphi weight method to evaluate the weight of path length, path smoothness, and path safety in the fitness function, and a collision detection method is proposed to detect whether the planned path collides with obstacles. Then, the population initialization process is improved to reduce the program running time. After comprehensively considering the population diversity and the number of algorithm iterations, the traditional crossover operator and mutation operator are improved, and the adaptive crossover operator and adaptive mutation operator are proposed to avoid the local optimal solution. Finally, an optimization operator is proposed to improve the quality of convergent individuals through the second optimization of convergent individuals. The simulation results show that the adaptive genetic algorithm based on collision detection is not only suitable for simulation maps with various sizes and obstacle distributions but also has excellent performance, such as greatly reducing the running time of the algorithm program, and the adaptive genetic algorithm based on collision detection can effectively solve the problems of the basic genetic algorithm.

A Natural Evolution Based Numerical Optimisation Framework to Develop and Enhance Airfoil-Slat Arrangement

2019 ◽  
Author(s):  
Sushrut Kumar ◽  
Priyam Gupta ◽  
Raj Kumar Singh
Keyword(s):  
Genetic Algorithm ◽  
Fitness Function ◽  
Fuel Efficiency ◽  
Optimal Solution ◽  
Leading Edge ◽  
Initial Population ◽  
Invasive Weed ◽  
Fitness Value ◽  
Leading Edge Slats ◽  
Dynamics Simulations

Abstract Leading Edge Slats are popularly being put into practice due to their capability to provide a significant increase in the lift generated by the wing airfoil and decrease in the stall. Consequently, their optimum design is critical for increased fuel efficiency and minimized environmental impact. This paper attempts to develop and optimize the Leading-Edge Slat geometry and its orientation with respect to airfoil using Genetic Algorithm. The class of Genetic Algorithm implemented was Invasive Weed Optimization as it showed significant potential in converging design to an optimal solution. For the study, Clark Y was taken as test airfoil. Slats being aerodynamic devices require smooth contoured surfaces without any sharp deformities and accordingly Bézier airfoil parameterization method was used. The design process was initiated by producing an initial population of various profiles (chromosomes). These chromosomes are composed of genes which define and control the shape and orientation of the slat. Control points, Airfoil-Slat offset and relative chord angle were taken as genes for the framework and different profiles were acquired by randomly modifying the genes within a decided design space. To compare individual chromosomes and to evaluate their feasibility, the fitness function was determined using Computational Fluid Dynamics simulations conducted on OpenFOAM. The lift force at a constant angle of attack (AOA) was taken as fitness value. It was assigned to each chromosome and the process was then repeated in a loop for different profiles and the fittest wing slat arrangement was obtained which had an increase in CL by 78% and the stall angle improved to 22°. The framework was found capable of optimizing multi-element airfoil arrangements.

Design of 3D-Route Planning Based on the Improvement of Simple Genetic Algorithm

2013 ◽  
Vol 760-762 ◽  
pp. 1690-1694
Author(s):  
Jian Xia Zhang ◽  
Tao Yu ◽  
Ji Ping Chen ◽  
Ying Hao Lin ◽  
Yu Meng Zhang
Keyword(s):  
Genetic Algorithm ◽  
Search Algorithm ◽  
Scientific Research ◽  
Route Planning ◽  
Optimal Solution ◽  
Global Search ◽  
Global Search Algorithm ◽  
Simple Genetic Algorithm ◽  
Local Optimal Solution ◽  
Simulation Results

With the wide application of UAV in the scientific research,its route planning is becoming more and more important. In order to design the best route planning when UAV operates in the field, this paper mainly puts to use the simple genetic algorithm to design 3D-route planning. It primarily introduces the advantages of genetic algorithm compared to others on the designing of route planning. The improvement of simple genetic algorithm is because of the safety of UAV when it flights higher, and the 3D-route planning should include all the corresponding areas. The simulation results show that: the improvement of simple genetic algorithm gets rid of the dependence of parameters, at the same time it is a global search algorithm to avoid falling into the local optimal solution. Whats more, it can meet the requirements of the 3D-route planning design, to the purpose of regional scope and high safety.

A Comparison of Hybrid Approaches for Turbofan Engine Gas Path Fault Diagnosis

2016 ◽  
Vol 33 (3) ◽  
Author(s):  
Feng Lu ◽  
Yafan Wang ◽  
Jinquan Huang ◽  
Qihang Wang
Keyword(s):  
Genetic Algorithm ◽  
Kalman Filter ◽  
Fault Diagnosis ◽  
Fitness Function ◽  
Performance Degradation ◽  
Estimation Accuracy ◽  
Adaptive Genetic Algorithm ◽  
Turbofan Engine ◽  
Gas Path Fault ◽  
Fault Mode

AbstractA hybrid diagnostic method utilizing Extended Kalman Filter (EKF) and Adaptive Genetic Algorithm (AGA) is presented for performance degradation estimation and sensor anomaly detection of turbofan engine. The EKF is used to estimate engine component performance degradation for gas path fault diagnosis. The AGA is introduced in the integrated architecture and applied for sensor bias detection. The contributions of this work are the comparisons of Kalman Filters (KF)-AGA algorithms and Neural Networks (NN)-AGA algorithms with a unified framework for gas path fault diagnosis. The NN needs to be trained off-line with a large number of prior fault mode data. When new fault mode occurs, estimation accuracy by the NN evidently decreases. However, the application of the Linearized Kalman Filter (LKF) and EKF will not be restricted in such case. The crossover factor and the mutation factor are adapted to the fitness function at each generation in the AGA, and it consumes less time to search for the optimal sensor bias value compared to the Genetic Algorithm (GA). In a word, we conclude that the hybrid EKF-AGA algorithm is the best choice for gas path fault diagnosis of turbofan engine among the algorithms discussed.

A Genetic Algorithm to Determine Production Schedule in an Imperfect Manufacturing System with Time-Vary Unit Cost

2014 ◽  
Vol 889-890 ◽  
pp. 1563-1568
Author(s):  
Bing Chang Ouyang ◽  
Yi Chen Lin
Keyword(s):  
Genetic Algorithm ◽  
Manufacturing System ◽  
Fitness Function ◽  
Unit Cost ◽  
Production Schedule ◽  
Defective Items ◽  
Total Cost ◽  
System A ◽  
Regular Production ◽  
Production Scheme

Considering time-vary in unit cost and imperfect quality in process, this study presents a genetic algorithm to deal with the production schedule and batch lot problem for a manufacturing system. Incorporating linearly and exponentially continuous unit production cost, we assume that defective items are reworked at a constant rate after regular production immediately. Not all of the defective items are reworked but a portion of them are scraped due to serious damage. Our objective is to minimize the expected value of total cost for this production system. A genetic algorithm with the chromosome of real number type to solve this problem is proposed. Standard GA operators are used to generate new populations. These populations are evaluated by a fitness function using the total cost of production scheme. An explicit procedure for obtaining an approximate solution is provided.

Sign in / Sign up

Export Citation Format

Share Document