Genetic simulated annealing algorithm-based assembly sequence planning

Author(s):  
Shan Hongbo ◽  
Li Shuxia ◽  
Gong Degang ◽  
Lou Peng
2012 ◽  
Vol 457-458 ◽  
pp. 628-634
Author(s):  
Jing Zhang ◽  
Yun Sheng Yang ◽  
Shao Wei Feng

In order to solve the problem of generating and optimizing the assembly sequences of a complex assembly, the oriented-mating graph model of the assembly and the related mating matrix are created. Then an improved simulated annealing algorithm is used to solve the ASP problem. This algorithm reflects the assembly cost to an energy function associated with the assembly sequence. The energy function is iteratively minimized and occasionally perturbed by a simulated annealing until no further change in the energy occurs. Finally, a living example is given to prove the validity of the method.


2021 ◽  
Vol 28 (2) ◽  
pp. 101-109

Software testing is an important stage in the software development process, which is the key to ensure software quality and improve software reliability. Software fault localization is the most important part of software testing. In this paper, the fault localization problem is modeled as a combinatorial optimization problem, using the function call path as a starting point. A heuristic search algorithm based on hybrid genetic simulated annealing algorithm is used to locate software defects. Experimental results show that the fault localization method, which combines genetic algorithm, simulated annealing algorithm and function correlation analysis method, has a good effect on single fault localization and multi-fault localization. It greatly reduces the requirement of test case coverage and the burden of the testers, and improves the effect of fault localization.


Sign in / Sign up

Export Citation Format

Share Document