Comparison of firefly and cockroach algorithms in selected discrete and combinatorial problems

Bulletin of the Polish Academy of Sciences. Technical Sciences

J. Kwiecie?Corresponding authorAGH University of Science and Technology, 30 Mickiewicza Ave., 30-059 Krakow, PolandEmailOther articles by this author:De Gruyter OnlineGoogle Scholar¹  B. FilipowiczAGH University of Science and Technology, 30 Mickiewicza Ave., 30-059 Krakow, PolandOther articles by this author:De Gruyter OnlineGoogle Scholar¹ 

[1] AGH University of Science and Technology, 30 Mickiewicza Ave., 30-059 Krakow, Poland

关键词: Keywords : queueing systems;    flow shop scheduling;    firefly algorithm;    cockroach algorithm;   

DOI  :  10.2478/bpasts-2014-0087

学科分类：工程和技术（综合）

来源: Polska Akademia Nauk * Centrum Upowszechniania Nauki / Polish Academy of Sciences, Center for the Advancement of Science

【 摘 要 】

In recent years, newer algorithms inspired by nature have been created and used to solve various problems. Therefore, in the paper we present the application of firefly and cockroach algorithms to optimize two queueing systems and permutation flow shop problems with the objective of minimizing the makespan. The article briefly describes these algorithms to solve selected problems and their results. Because these algorithms were originally developed for continuous optimization problems, we introduce a new formula to transform the position of ith individual to solve the discrete problems.

【 授权许可】

Unknown