[1]GUO Liping,LI Xiangtao,GU Wenxiang,et al.An improved firefly algorithm for the blocking flow shop scheduling problem[J].CAAI Transactions on Intelligent Systems,2013,8(1):33-38.[doi:10.3969/j.issn.1673-4785.201205012]
Copy

An improved firefly algorithm for the blocking flow shop scheduling problem

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 8 Number of periods: 2013 1 Page number: 33-38 Column: 学术论文—智能系统 Public date: 2013-03-25
Title:
An improved firefly algorithm for the blocking flow shop scheduling problem
Author(s):
GUO Liping 1;  LI Xiangtao 1;  GU Wenxiang 1; 2 ;  YIN Minghao 1
1. Department of Computer Science and Information Technology, Northeast Normal University, Changchun 130117, China;
2. Department of Basic Subjects Teaching, Changchun Architecture & Civil Engineering College, Changchun 130607, China
Keywords:
blocking flow shop scheduling problem;  firefly algorithm;  discrete mechanism;  NEH heuristic method;  local search
CLC:
TP301.6
DOI:
10.3969/j.issn.1673-4785.201205012
Abstract:
In order to improve the solving performance of the blocking flow shop scheduling problem, the researcher proposes to examine an improved firefly algorithm. Firstly, a discrete mechanism was proposed to convert the real coded form of individuals to discrete job sequences, so that the algorithm could be used to deal with discrete problems. Secondly, a doubleinitialization method was designed and the NEH (Nawaz Enscore Ham) heuristic method was applied to the initialization, which provided a superior initial environment and improved the quality of the solution of the initial population. In addition, the research paper focused on redesigning the movement pattern of individuals to enhance the search space. Finally, a local search algorithm was applied to individuals with a certain probability, for the purpose of enhancing the ability to search locally. The improved firefly algorithm was then tested utilizing the Taillard datasets, and the results verified the effectiveness of the new algorithm.
References:
［1］ALLAHYERDI A, NG C T, CHENG T C E, et al. A survey of scheduling problems with setup times or costs［J］. European Journal of Operational Research, 2008, 187(3): 985-1032.
［2］MCCORMICK S T, PINEDO M L, SHENKER S, et al. Sequencing in an assembly line with blocking to minimize cycle time［J］. Operations Research, 1989, 37(6): 925-935.
［3］RONCONI D P. A note on constructive heuristics for the flowshop problem with blocking［J］. International Journal of Production Economics, 2004, 87(1): 39-48.
［4］CARAFFA V, IANES S, BAGCHI T P, et al. Minimizing makespan in a blocking flowshop using genetic algorithms［J］. International Journal of Production Economics, 2001, 70(2): 101-115.
［5］RONCONI D P. A branch and bound algorithm to minimize the makespan in a flowshop with blocking［J］. Annals of Operations Research, 2005, 138(1): 53-65.
［6］GRABOWSKI J, PEMPERA J. The permutation flow shop problem with blocking. A tabu search approach［J］. Omega, 2007, 35(3): 302-311.
［7］WANG Ling, PAN Quanke, SUGANTHAN P N, et al. A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems［J］. Computers & Operations Research, 2010, 37(3): 509-520.
［8］YANG Xinshe. Nature inspired metaheuristic algorithms［M］. Frome, UK: Luniver Press, 2008: 81-96.
［9］YANG Xinshe. Firefly algorithms for multimodal optimization［C］//Proceedings of the 5th International Conference on Stochastic Algorithms: Foundations and Applications. Berlin/Heidelberg, Germany: Springer Verlag, 2009: 169-178.
［10］NAWAZ M, ENSCORE E E J, HAM I. A heuristic algorithm for the m machine, n job flow shop sequencing problem［J］. Omega, 1983, 11(1): 91-95.
［11］BROWN C T, LIEBOVITCH L S, GLENDON R. Lévy flights in Dobe Ju/’ hoansi foraging patterns［J］. Human Ecology, 2007, 35(1): 129-138.
［12］PAVLYUKEVICH I. Lévy flights, nonlocal search and simulated annealing［J］. Journal of Computational Physics, 2007, 226(2): 1830-1844.
［13］YANG Xinshe. Firefly algorithm, Lévy flights and global optimization［C］//Research and Development in Intelligent Systems XXVI. London, UK: Springer, 2010: 209-218.
［14］YANG Xinshe. Firefly algorithm, stochastic test functions and design optimization［J］. International Journal of Bio Inspired Computation, 2010, 2(2): 78-84.
Similar References:

Memo

-

Last Update: 2013-04-12

Copyright © CAAI Transactions on Intelligent Systems