Designing a Near Optimal Solution via Simulated Annealing for Dimensional Chain Assembly
- 7 Downloads
To assembly products from some workpiece, the assemblies have to calculate the assemble plan in advance. However, the workpiece of different parts result in the product sizes, and calculating the assembly plan efficiently to assemble the products what fit the requirements is necessary. In this paper, we first define the dimensional chain assembly (DCA) problem, and propose a simulated annealing-based algorithm to calculate the assembly plan. We find out the threshold of the maximum iterations and the balance between the solution quality and the computational efficiency.
KeywordsDimensional chain assembly Simulated annealing Optimization
This work was supported in part by National Chin-Yi University of Technology Taiwan under Grant no. NCUT 19-R-CC-008. The authors would like to thank reviewers for their insightful comments which helped to significantly improve the paper.
- 3.Kennedy, J., Eberhart, R.: Particle swarm optimization (PSO). In: Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)Google Scholar
- 4.Dorigo, M., Di Caro, G.: Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 Congress on IEEE Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol. 2, pp. 1470–1477 (1999)Google Scholar