A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems

Sayadi, Mohammad Kazem; Ramezanian, Reza; Ghaffarinasab, Nader

doi:10.5267/j.ijiec.2010.01.001

Cited by 183 publications

(122 citation statements)

References 17 publications

(18 reference statements)

Supporting

Mentioning

104

Contrasting

Unclassified

Order By: Relevance

“…The firefly algorithm can also participated in (42-44) (45), the fireflies also participated (46)(47)(48). firefly algorithm also involved for (49,50). Apart of all the above firefly algorithm (51).…”

Section: B Applications Areas Of Fire Fly Optimizationmentioning

confidence: 99%

A Review of Bio Inspired Computing and its Applications

kumar¹,

Bhargava²

2018

J.JBTW

View full text Add to dashboard Cite

Bio Inspired computation is the part of Artificial intelligence which was inspired by the biological behaviors of biological systems. Swarm intelligence is the collective behavior of an organized group in day-to-day life. Common examples of swarm intelligence include ant colony, bee colony, etc. and some are non-swarm intelligence like bat algorithm, etc. This study mainly focuses on application areas of various bio inspired computing based swarm and non-swarm intelligence. This review also discusses the newly developed algorithms. Specific application areas of such algorithms have been discussed in this research. This research highlighted the future scope of present algorithms.

show abstract

Section: B Applications Areas Of Fire Fly Optimizationmentioning

confidence: 99%

A Review of Bio Inspired Computing and its Applications

kumar¹,

Bhargava²

2018

J.JBTW

View full text Add to dashboard Cite

show abstract

“…Several discrete formulations of the FA have been applied to the discrete optimization problems in the context of operations management (Sayadi et al, 2010;Lu & Wang, 2016;Osaba et al, 2016;Zhou et al, 2015).…”

Section: Modified Discrete Firefly Algorithmmentioning

confidence: 99%

Solving machine loading problem of flexible manufacturing systems using a modified discrete firefly algorithm

Bottani¹,

Centobelli²,

Cerchione³

et al. 2017

10.5267/j.ijiec

View full text Add to dashboard Cite

This paper proposes a modified discrete firefly algorithm (DFA) applied to the machine loading problem of the flexible manufacturing systems (FMSs) starting from the mathematical formulation adopted by Swarnkar & Tiwari (2004). The aim of the problem is to identify the optimal jobs sequence that simultaneously maximizes the throughput and minimizes the system unbalance according to given technological constraints (e.g. available tool slots and machining time). The results of the algorithm proposed have been compared with the existing and most recent swarm-based approaches available in the open literature using as benchmark the set of ten problems proposed by Mukhopadhyay et al. (1992). The algorithm shows results that are comparable and sometimes even better than most of the other approaches considering both the quality of the results provided and the computational times obtained.

show abstract

“…Therefore, we must replace this real number by a binary number. The following sigmoid function restricts x ik ð Þ to be in the interval of zero to one (Sayadi et al 2010):…”

Section: The Operators In Hcdfamentioning

confidence: 99%

“…The original firefly algorithm has been used for solving continuous optimization problems. Sayadi et al (2010) suggested a discrete firefly algorithm for flow shop scheduling problem. In fact, they modify the original firefly for discrete problems.…”

Section: Introductionmentioning

confidence: 99%

A firefly algorithm for solving competitive location-design problem: a case study

et al. 2016

Self Cite

View full text Add to dashboard Cite

This paper aims at determining the optimal number of new facilities besides specifying both the optimal location and design level of them under the budget constraint in a competitive environment by a novel hybrid continuous and discrete firefly algorithm. A real-world application of locating new chain stores in the city of Tehran, Iran, is used and the results are analyzed. In addition, several examples have been solved to evaluate the efficiency of the proposed model and algorithm. The results demonstrate that the performed method provides good-quality results for the test problems.

show abstract

A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems

Cited by 183 publications

References 17 publications

A Review of Bio Inspired Computing and its Applications

A Review of Bio Inspired Computing and its Applications

Solving machine loading problem of flexible manufacturing systems using a modified discrete firefly algorithm

A firefly algorithm for solving competitive location-design problem: a case study

Contact Info

Product

Resources

About