A New Approach to Network Optimization Using Chaos-Genetic Algorithm

Author(s):  
Golnar Gharooni-fard ◽  
Fahime Moein-darbari
Author(s):  
Ganesh Marotrao KAKANDIKAR ◽  
Vilas M. NANDEDKAR

Forming is a compression-tension process involving wide spectrum of operations and flow conditions. The result of the process depends on the large number of parameters and their interdependence. The selection of various parameters is still based on trial and error methods. In this paper the authors presents a new approach to optimize the geometry parameters of circular components, process parameters such as blank holder pressure and coefficient of friction etc. The optimization problem has been formulated with the objective of optimizing the maximum forming load required in Forming. Genetic algorithm is used for the optimization purpose to minimize the drawing load and to optimize the process parameters. A finite element analysis simulation software Fast Form Advanced is used for the validations of the results after optimization.


2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Yixin Zhou ◽  
Zhen Guo

With the advent of the era of big data (BD), people’’s living standards and lifestyle have been greatly changed, and people’s requirements for the service level of the service industry are becoming higher and higher. The personalized needs of customers and private customization have become the hot issues of current research. The service industry is the core enterprise of the service industry. Optimizing the service industry supply network and reasonably allocating the tasks are the focus of the research at home and abroad. Under the background of BD, this paper takes the optimization of service industry supply network as the research object and studies the task allocation optimization of service industry supply network based on the analysis of customers’ personalized demand and user behavior. This paper optimizes the supply chain network of service industry based on genetic algorithm (GA), designs genetic operator, effectively avoids the premature of the algorithm, and improves the operation efficiency of the algorithm. The experimental results show that when m = 8 and n = 40, the average running time of the improved GA is 54.1 s. The network optimization running time of the algorithm used in this paper is very fast, and the stability is also higher.


Sign in / Sign up

Export Citation Format

Share Document