Solving the Permutation Flow Shop Problem with Firefly Algorithm

被引：4

作者：

Fong, Simon ^{[1
]}

Lou, Hui-long ^{[1
]}

Zhuang, Yan ^{[1
]}

Deb, Suash ^{[2
]}

Hanne, Thomas ^{[3
]}

机构：

[1] Univ Macau, Dept Comp & Informat Sci, Taipa, Macao, Peoples R China

[2] Cambridge Inst Technol, Dept Comp Sci & Engn, Ranchi, Bihar, India

[3] Univ Appl Sci Northwestern Switzerland, Inst Informat Syst, Olten, Switzerland

来源：

PROCEEDINGS OF 2014 2ND INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL AND BUSINESS INTELLIGENCE (ISCBI) | 2014年

关键词：

Firefly algorithm; NP-hard; PFSP; Simulation; SCHEDULING PROBLEM; OPTIMIZATION; TARDINESS; EARLINESS; SEARCH;

D O I：

10.1109/ISCBI.2014.13

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

080201 [机械制造及其自动化];

摘要：

Firefly algorithm (FA) is a new member of bionic swarm intelligence optimization algorithms. In this paper the bionic principle of FA is investigated and extended to solving a well-known NP-hard problem: Permutation Flow-Shop Scheduling Problem (PFSP). A corresponding solution strategy for PFSP bound is designed with its scheduling features. The strategy is implemented in experimentation on MATLAB workspace. At the end of the simulation, the experiment results verified that the effectiveness and feasibility offered by FA in solving the combinatorial PFSP optimization problems.

引用

页码：25 / 29

页数：5

共 16 条

[1]

[Anonymous], SENSORS TRANSDUCER S

[2]

[Anonymous], 2008, NATURE INSPIRED META

[3]

Bean J. C., 1994, ORSA Journal on Computing, V6, P154, DOI 10.1287/ijoc.6.2.154

[4]

Blum C., 2004, J MATH MODELLING ALG, V3, P285, DOI DOI 10.1023/B:JMMA.0000038614.39977.6F