返回
Applying Improved Particle Swarm Optimization to Asynchronous Parallel Disassembly Planning
DOI:10.1109/ACCESS.2022.3195863.png)
摘要
En 中文
Disassembly Planning (DP) refers to an optimization method to find the most cost-effective disassembly sequence for products based on the disassembly properties of parts. In traditional sequential disassembly planning, only a single part or component is removed. To effectively improve the product disassembly efficiency, this study explores the problem of Asynchronous Parallel Disassembly Planning (aPDP) with multiple manipulators. In the aPDP situation where multiple manipulators are used, the optimization method of arranging the manipulators needs to be considered in addition to the limitation of the priority order of parts. This study proposes an improved particle swarm optimization to discuss the aPDP combination optimization problem. The minimum Make Span is the objective, and the solution status and convergence speed are compared with the results of other particle swarm optimization methods, a Genetic Algorithm and Ant Colony Optimization. The results show that the proposed improved version of the particle swarm optimization algorithm has better solution quality and execution time.
Keyword:
Manipulators
Planning
Particle swarm optimization
Task analysis
Genetic algorithms
Optimization methods
Mathematical models
Asynchronous parallel disassembly planning (aPDP)
genetic algorithm (GA)
ant colony optimization (ACO)
improved particle swarm optimization (IPSO)
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Reading disorders in a language with shallow orthography: A multiple single-case study in Italian浅拼字法语言的阅读障碍: 意大利语的多个单例研究
Aphasiology
IF0
Particle swarm optimisation in designing parameters of manufacturing processes: A review (2008-2018)
Integrated multi-layer representation and ant colony search for product selective disassembly planning集成多层表示和蚁群搜索的产品选择性拆卸计划

