2021
DOI: 10.1007/s00500-021-05673-w
|View full text |Cite
|
Sign up to set email alerts
|

Solution for flow shop scheduling problems using chaotic hybrid firefly and particle swarm optimization algorithm with improved local search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(14 citation statements)
references
References 73 publications
0
14
0
Order By: Relevance
“…Kaya and others introduced the fuzzy control theory into mobile robot path planning and proposed a robot path planning method based on multiple motion instruction sets. This method uses fuzzy rules to guide the motion of the robot, avoids the disadvantage of poor real-time performance of mobile robot path planning due to large amount of calculation, and achieved good simulation results [14]. Pahnehkolaei and others combined the improved genetic algorithm with the Dijkstra algorithm (DA) to optimize the robot path and designed a heuristic way to generate the initial population.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Kaya and others introduced the fuzzy control theory into mobile robot path planning and proposed a robot path planning method based on multiple motion instruction sets. This method uses fuzzy rules to guide the motion of the robot, avoids the disadvantage of poor real-time performance of mobile robot path planning due to large amount of calculation, and achieved good simulation results [14]. Pahnehkolaei and others combined the improved genetic algorithm with the Dijkstra algorithm (DA) to optimize the robot path and designed a heuristic way to generate the initial population.…”
Section: Literature Reviewmentioning
confidence: 99%
“…(5) Calculate the fitness value of t 1 . If it is better than the previous generation, the next generation particle swarm t 2 will be generated; otherwise, it will be converted to Cartesian coordinates [20]. (6) e algorithm is over.…”
Section: Improve Pso Path Planning Algorithm Flowmentioning
confidence: 99%
“…Particle swarm optimization algorithm with dynamic nonlinear inertial weights was used for robot path planning (static obstacles) [21]. Simulation parameters are starting point [5,5], target point [25,25], polar radius � 5, obstacle point [20,20], [8,10], [10,10], [12,10], [24,20], [18,20]; learning factor c 1 � c 2 � 1.4962; inertia weight w max � 0.9; w min �0.4; dimension of search space m 10; population number N 30, iteration number T, maximum iteration number DT max 2000;…”
Section: Static Obstacle Avoidance With Particle Swarmmentioning
confidence: 99%
See 1 more Smart Citation
“…As the inertia weight of particle swarm increases, the planning ability of the algorithm will be enhanced. As the inertia weight of particle swarm decreases, the algorithm will only have local planning ability [13]. Generally, the optimal range of particle swarm inertia weight parameter is 0 ∼ 1.4, but the convergence speed of the algorithm will be accelerated when the value of particle swarm inertia weight parameter is 0.8 ∼ 1.2.…”
Section: Selecting Particle Swarm Optimizationmentioning
confidence: 99%