scholarly journals Optimization and Design of Hammerheads and Fenders on Scrap Metal Shredders Based on Improved Genetic Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
He Tian ◽  
Guoqiang Wang ◽  
Kangkang Sun ◽  
Zeren Chen ◽  
Chuliang Yan ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Dynamic Balance ◽  
Optimal Solution ◽  
Scrap Metal ◽  
Improved Genetic Algorithm ◽  
Multiple Traveling Salesman Problem ◽  
Local Optimal Solution ◽  
Annealing Algorithm

Dynamic unbalance force is an important factor affecting the service life of scrap metal shredders (SMSs) as the product of mass error. Due to the complexity of hammerheads arrangement, it is difficult to take all the parts of the hammerhead into account in the traditional methods. A novel optimization algorithm combining genetic algorithm and simulated annealing algorithm is proposed to improve the dynamic balance of scrap metal shredders. The optimization of hammerheads and fenders on SMS in this paper is considered as a multiple traveling salesman problem (MTSP), which is a kind of NP-hard problem. To solve this problem, an improved genetic algorithm (IGA) combined with the global optimization characteristics of genetic algorithm (GA) and the local optimal solution of simulated annealing algorithm (SA) is proposed in this paper, which adopts SA in the process of selecting subpopulations. The optimization results show that the resultant force of the shredder central shaft by using IGA is less than the traditional metaheuristic algorithm, which greatly improves the dynamic balance of the SMS. Validated via ADAMS simulation, the results are in good agreement with the theoretical optimization analysis.

scholarly journals An Effective Heuristic-Based Approach for Partitioning

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Xibin Zhao ◽  
Hehua Zhang ◽  
Yu Jiang ◽  
Songzheng Song ◽  
Xun Jiao ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Embedded System ◽  
Simulated Annealing Algorithm ◽  
Optimal Solution ◽  
Local Optimal Solution ◽  
Annealing Algorithm ◽  
The Cost ◽  
Combined Algorithm ◽  
Search Capability

As being one of the most crucial steps in the design of embedded systems, hardware/software partitioning has received more concern than ever. The performance of a system design will strongly depend on the efficiency of the partitioning. In this paper, we construct a communication graph for embedded system and describe the delay-related constraints and the cost-related objective based on the graph structure. Then, we propose a heuristic based on genetic algorithm and simulated annealing to solve the problem near optimally. We note that the genetic algorithm has a strong global search capability, while the simulated annealing algorithm will fail in a local optimal solution easily. Hence, we can incorporate simulated annealing algorithm in genetic algorithm. The combined algorithm will provide more accurate near-optimal solution with faster speed. Experiment results show that the proposed algorithm produce more accurate partitions than the original genetic algorithm.

Research on Parallel Test Task Scheduling Based on Improved Genetic Algorithm and Petri Net

2014 ◽  
Vol 543-547 ◽  
pp. 1119-1122
Author(s):  
Pei Pei Chen ◽  
Bao Mei Qiu ◽  
Hao Ba
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Task Scheduling ◽  
Petri Net ◽  
Simulated Annealing Algorithm ◽  
Optimal Path ◽  
Optimal Solution ◽  
Improved Genetic Algorithm ◽  
Test Task ◽  
Parallel Test

Parallel test task scheduling is always complex and difficult to optimize. Aiming at this problem, an improved Genetic Simulated Annealing Algorithm based on Petri net is posed to. At first, a Petri net model is established for the system, then the transition sequence is used as task scheduling sequence set path. Genetic Algorithm is introduced in order to get the optimal path. In the process of search, the sequence will be able to stimulate changes as chromosomes, selection, crossover and mutation. In order to prevent premature convergence of the algorithm appears, into the phenomenon of local optimal solution, the individual needs simulated annealing operation, and finally, we can get the shortest time to complete the test task scheduling sequence.

Artificial Intelligence Application in Modern Management

2010 ◽  
Vol 37-38 ◽  
pp. 203-206
Author(s):  
Rong Jiang
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Local Optimum ◽  
Efficient Operation ◽  
Modern Management ◽  
Global Optimal ◽  
Annealing Algorithm

Modern management is a science of technology that adopts analysis, test and quantification methods to make a comprehensive arrangement of the limited resources to realize an efficient operation of a practical system. Simulated annealing algorithm has become one of the important tools for solving complex optimization problems, because of its intelligence, widely used and global search ability. Genetic algorithm may prevent effectively searching process from restraining in local optimum, thus it is more possible to obtains the global optimal solution.This paper solves unconstrained programming by simulated annealing algorithm and calculates constrained nonlinear programming by genetic algorithm in modern management. So that optimization process was simplified and the global optimal solution is ensured reliably.

An Improved Simulated Annealing Algorithm Based on Genetic Algorithm

2012 ◽  
Vol 490-495 ◽  
pp. 267-271 ◽  
Author(s):  
Shu Fei Li
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Reservoir Operation ◽  
Simulated Annealing Algorithm ◽  
Optimal Solution ◽  
Optimization Method ◽  
Operation Speed ◽  
Ga Algorithm ◽  
Hybrid Simulated Annealing ◽  
Annealing Algorithm

An effective hybrid Simulated Annealing Algorithm based on Genetic Algorithm is proposed to apply to reservoir operation. Compared with other optimal methods, it is proved that SA-GA algorithm is a quite effective optimization method to solve reservoir operation problem. The simulated annealing algorithm is introduced to Genetic Algorithm, which is feasibility and validity. As a result of stronger ability of global search and better convergence property of SA-GA, and compared with other algorithms, the approximate global optimal solution would be obtained in little time. The operation speed is more quickness and the results are more stabilization by SA-GA, than Genetic Algorithm and the traditional Dynamic Programming and POA.

A novel evacuation path planning method based on improved genetic algorithm

2021 ◽  
pp. 1-11
Author(s):  
Longzhen Zhai ◽  
Shaohong Feng
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Path Planning ◽  
Simulated Annealing Algorithm ◽  
Planning Method ◽  
Improved Genetic Algorithm ◽  
Genetic Operator ◽  
Probability Operator ◽  
Annealing Algorithm ◽  
Evacuation Route

In order to solve the problem of finding the best evacuation route quickly and effectively, in the event of an accident, a novel evacuation route planning method is proposed based on Genetic Algorithm and Simulated Annealing algorithm in this paper. On the one hand, the simulated annealing algorithm is introduced and a simulated annealing genetic algorithm is proposed, which can effectively avoid the problem of the search process falling into the local optimal solution. On the other hand, an adaptive genetic operator is designed to achieve the purpose of maintaining population diversity. The adaptive genetic operator includes an adaptive crossover probability operator and an adaptive mutation probability operator. Finally, the path planning simulation verification is carried out for the genetic algorithm and the improved genetic algorithm. The simulation results show that the improved method has greatly improved the path planning distance and time compared with the traditional genetic algorithm.

scholarly journals A simulated annealing algorithm for vehicle scheduling problem

2017 ◽  
Vol 1 (Q4) ◽  
pp. 70-77
Author(s):  
Ha Thi Mai Phan
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Time Window ◽  
Fresh Concrete ◽  
Waiting Times ◽  
Optimal Solution ◽  
Production Scale ◽  
Construction Companies ◽  
Annealing Algorithm ◽  
Concrete Tank

As the construction activity has been growing, the companies that supply fresh concrete expand their production scale to meet their customers’ needs. The more customers, the longer queue tank trucks have to wait to pick up the fresh concrete. The customers are construction companies that have different construction works at the same time while the transportation time is only at night. They have to schedule efficiently the fleet of fresh concrete tank trucks during the night (turning the tank trucks a few turns) with constraints on the time window for the transfer of fresh concrete from the concrete company to the construction site as well as constraints on the waiting time for loading fresh concrete in the company. The scheduling for the fleet of construction company’s tank trucks will be modeled to minimize total transportation costs (fixed, variable) with estimated waiting times and tank truck’s turns several times during the night. The model of logistics problem is NP hard; Therefore, two algorithms are proposed to find the nearly optimal solution: heuristics and simulated annealing algorithm. The results will be compared and analyzed.

Sign in / Sign up

Export Citation Format

Share Document