2019
DOI: 10.4018/978-1-5225-6164-4.ch003
|View full text |Cite
|
Sign up to set email alerts
|

Bat Algorithm With Generalized Fly for Combinatorial Production Optimization Problems

Abstract: A set of metaheuristics has proved its efficiency in solving rapidly NP-hard problems. Several combinatorial and continuous optimization areas drew profit from these powerful alternative techniques. This chapter intends to describe a discrete version of bat algorithm (BA) combined to generalized walk evolutionary (GEWA), also called bat algorithm with generalized fly or walk (BAG) in order to solve discrete industrial optimization. The first case of study is the well-known hybrid flow shop scheduling. The seco… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 64 publications
0
0
0
Order By: Relevance
“…A bat algorithm with generalized flight (BAG) is a hybridization of the bat algorithm and the GEWA algorithm. It was first introduced by [37] and then applied to manufacturing system scheduling in [38], and to a green economic power dispatch problem in [39]. Our improvement lies in adding a global search function to the classical BA, which is the global flight of the worst bats.…”
Section: Redundancy Optimization Methodsmentioning
confidence: 99%
“…A bat algorithm with generalized flight (BAG) is a hybridization of the bat algorithm and the GEWA algorithm. It was first introduced by [37] and then applied to manufacturing system scheduling in [38], and to a green economic power dispatch problem in [39]. Our improvement lies in adding a global search function to the classical BA, which is the global flight of the worst bats.…”
Section: Redundancy Optimization Methodsmentioning
confidence: 99%