Firefly-inspired algorithm for discrete optimization problems: An application to manufacturing cell formation

被引:85
作者
Sayadi, Mohammad Kazem [1 ]
Hafezalkotob, Ashkan [2 ]
Naini, Seyed Gholamreza Jalali [1 ]
机构
[1] Iran Univ Sci & Technol, Dept Ind Engn, Tehran, Iran
[2] Islamic Azad Univ, Dept Ind Engn, South Tehran Branch, Tehran, Iran
关键词
Metaheuristic; Firefly algorithm; Discrete optimization; Cellular manufacturing; CLUSTERING-ALGORITHM;
D O I
10.1016/j.jmsy.2012.06.004
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The canonical firefly algorithm is basically developed for continuous optimization problems. However, lots of practical problems are formulated as discrete optimization problems. The main purpose of this paper is to present the discrete firefly algorithm (DFA) to solve discrete optimization problems. In the DFA, we define a firefly's position in terms of changes of probabilities that will be in one state or the other. Then by using this metaheuristic algorithm, the manufacturing cell formation problem is solved. To illustrate the behavior of the proposed model and verify the performance of the algorithm, we introduce a number of numerical examples to illustrate the use of the foregoing algorithm. The performance evaluation shows the effectiveness of the DFA. The proposed metaheuristic algorithm should thus be useful to both researchers and practitioners. (C) 2012 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:78 / 84
页数:7
相关论文
共 42 条
[1]  
Abbass HA, 2001, IEEE C EVOL COMPUTAT, P207, DOI 10.1109/CEC.2001.934391
[2]   A mathematical approach for the formation of manufacturing cells [J].
Albadawi, Z ;
Bashir, HA ;
Chen, MY .
COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 48 (01) :3-21
[3]  
[Anonymous], 2010, Int. J. Ind. Eng. Comput, DOI DOI 10.5267/J.IJIEC.2010.01.001
[4]   Bi-criteria flexible job-shop scheduling with sequence-dependent setup times-Variable neighborhood search approach [J].
Bagheri, A. ;
Zandieh, M. .
JOURNAL OF MANUFACTURING SYSTEMS, 2011, 30 (01) :8-15
[5]   A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem [J].
Boulif, M ;
Atif, K .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (08) :2219-2245
[6]  
Burbidge J.L., 1963, PRODUCTION ENG, P742, DOI DOI 10.1049/TPE.1963.0114
[7]   Two-stage approach for machine-part grouping and cell layout problems [J].
Chan, FTS ;
Lau, KW ;
Chan, PLY ;
Choy, KL .
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2006, 22 (03) :217-238
[8]   MODROC - AN EXTENSION OF RANK ORDER CLUSTERING FOR GROUP TECHNOLOGY [J].
CHANDRASEKHARAN, MP ;
RAJAGOPALAN, R .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1986, 24 (05) :1221-1233
[9]   Scheduling a single batch-processing machine with non-identical job sizes in fuzzy environment using an improved ant colony optimization [J].
Cheng, Bayi ;
Li, Kai ;
Chen, Bo .
JOURNAL OF MANUFACTURING SYSTEMS, 2010, 29 (01) :29-34
[10]   Ant algorithms for discrete optimization [J].
Dorigo, M ;
Di Caro, G ;
Gambardella, LM .
ARTIFICIAL LIFE, 1999, 5 (02) :137-172