The purpose of this paper is to propose a novel method under the name of genetic simulated annealing algorithm (GSAA) and ant colony optimization (ACO) algorithm for assembly sequence planning (ASP) which is possessed of the competence for assisting the planner in generating a satisfied and effective assembly sequence with respect to large constraint assembly perplexity.
Based on the genetic algorithm (GA), simulated annealing, and ACO algorithm, the GSAA are put forward. A case study is presented to validate the proposed method.
This GSAA has better optimization performance and robustness. The degree of dependence on the initial assembly sequence about GSAA is decreased. The optimization assembly sequence still can be obtained even if the assembly sequences of initial population are infeasible. By combining GA and simulated annealing (SA), the efficiency of searching and the quality of solution of GSAA is improved. As for the presented ACO algorithm, the searching speed is further increased.
Traditionally, GA heavily depends on the choosing original sequence, which can result in early convergence in iterative operation, lower searching efficiency in evolutionary process, and non‐optimization of final result for global variable. Similarly, SA algorithms may generate a great deal of infeasible solutions in the evolution process by generating new sequences through exchanging position of the randomly selected two parts, which results in inefficiency of the solution‐searching process. In this paper, the proposed GSAA and ACO algorithm for ASP are possessed of the competence for assisting the planner in generating a satisfied and effective assembly sequence with respect to large constraint assembly perplexity.
