An improved fireworks algorithm for the constrained single-row facility layout problem
- 24 February 2020
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 59 (8) , 2309-2327
Abstract
The single-row facility layout problem (SRFLP) decides upon the arrangement of facilities in a straight row so as to minimise the material handling cost. Generally, this problem allows the placement of the facilities in any location in any order without any restriction, but some practical SRFLP cases are required to meet various types of constraints imposed on the placement of its facilities in the engineering of the placement of factory machinery and equipment. According to this new perspective, we studied the constrained SRFLP (cSRFLP) in this paper. In this problem, a few facilities need to be placed in certain positions or specified orders with or without the requirement to be located next to each other. To address this novel layout problem, related constraints are defined and classified, and novel mixed-integer programming models for the problem are formulated. Subsequently, the CPLEX software is employed to solve this problem. Then a constrained improved fireworks algorithm is presented, which is discretised to solve the considered cSRFLP. Our computational experiments demonstrate that the proposed algorithm performs better than the existing algorithms in solving the problem.Keywords
This publication has 49 references indexed in Scilit:
- Single row facility layout problem using a permutation-based genetic algorithmEuropean Journal of Operational Research, 2011
- A simple heuristic for linear sequencing of machines in layout designInternational Journal of Production Research, 2011
- An efficient tabu algorithm for the single row facility layout problemEuropean Journal of Operational Research, 2010
- A particle swarm optimization for the single row facility layout problemComputers & Industrial Engineering, 2010
- Heuristics for the dynamic facility layout problem with unequal-area departmentsEuropean Journal of Operational Research, 2010
- A new lower bound for the single row facility layout problemDiscrete Applied Mathematics, 2009
- Optimal solution for the two-dimensional facility layout problem using a branch-and-bound algorithmComputers & Industrial Engineering, 2008
- On the exact solution of a facility layout problemEuropean Journal of Operational Research, 2006
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problemEuropean Journal of Operational Research, 2005
- An ant algorithm for the single row layout problem in flexible manufacturing systemsComputers & Operations Research, 2005