2021
DOI: 10.1109/access.2020.3046495
|View full text |Cite
|
Sign up to set email alerts
|

Printed Circuit Board Assembly Planning for Multi-Head Gantry SMT Machine Using Multi-Swarm and Discrete Firefly Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 38 publications
0
6
0
Order By: Relevance
“…Through new features and intelligent jump, I-SFLA2 can find better solutions than some of the methods previously proposed. Hsu [14] also proposed a multi-group discrete firefly algorithm (MDFA), which is used to simultaneously deal with the component scheduling problem and feeder assignment problem of the multi-head gantry surface mounting technology machine. MDFA is an improved version of the standard firefly algorithm (FA), which is a meta-heuristic algorithm based on nature and population.…”
Section: Mounting Path Of Chip Mountermentioning
confidence: 99%
“…Through new features and intelligent jump, I-SFLA2 can find better solutions than some of the methods previously proposed. Hsu [14] also proposed a multi-group discrete firefly algorithm (MDFA), which is used to simultaneously deal with the component scheduling problem and feeder assignment problem of the multi-head gantry surface mounting technology machine. MDFA is an improved version of the standard firefly algorithm (FA), which is a meta-heuristic algorithm based on nature and population.…”
Section: Mounting Path Of Chip Mountermentioning
confidence: 99%
“…Due to the correlation between mount efficiency and the total path of the robot, the objective of this algorithm optimization is to minimize the mount paths of three robots [28][29][30][31]. The objective function is as follows:…”
Section: Establishment Of Optimization Objectivesmentioning
confidence: 99%
“…With the development of intelligence, more and more intelligent optimization algorithms have been proposed to resolve the inverse kinematics of the HRM, such as neural network algorithms [6][7][8], particle swarm optimization algorithms [9,10], differential evolution algorithms [11,12], genetic algorithms [13], simulates anneal arithmetic [14], firefly swarm algorithms [15][16][17], artificial bee swarm algorithms [18], and other intelligent algorithms. Although intelligent algorithms can achieve an optimized solution, multiple iterations are carried out, resulting in a longer calculation time with a loss of the capability for real-time solving and a possibility of falling into the local optimal point or non-convergence, while the ability to avoid obstacles is not considered in many intelligent algorithms.…”
Section: Introductionmentioning
confidence: 99%