Abstract
We extended an improved version of the discrete particle swarm optimization (DPSO) algorithm proposed by Liao et al. (2007) to solve the dynamic facility layout problem (DFLP). A computational study was performed with the existing heuristic algorithms, including the dynamic programming (DP), genetic algorithm (GA), simulated annealing (SA), hybrid ant system (HAS), hybrid simulated annealing (SA-EG), hybrid genetic algorithms (NLGA and CONGA). The proposed DPSO algorithm, SA, HAS, GA, DP, SA-EG, NLGA, and CONGA obtained the best solutions for 33, 24, 20, 10, 12, 20, 5, and 2 of the 48 problems from (Balakrishnan and Cheng, 2000), respectively. These results show that the DPSO is very effective in dealing with the DFLP. The extended DPSO also has very good computational efficiency when the problem size increases.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Armour, G.C., Buffa, E.S., 1963. A heuristic algorithm and simulation approach to relative allocation of facilities. Manag. Sci., 9(2):294–300. [doi:10.1287/mnsc.9.2.294]
Balakrishnan, J., Cheng, C.H., 1998. Dynamic layout algorithms: a state-of-the-art survey. Omega, Int. J. Manag. Sci., 26(4):507–521. [doi:10.1016/S0305-0483(97)00078-9]
Balakrishnan, J., Cheng, C.H., 2000. Genetic search and the dynamic layout problem. Comput. Oper. Res., 27(6):587–593. [doi:10.1016/S0305-0548(99)00052-0]
Balakrishnan, J., Jacobs, R.F., Venkataramanan, M.A., 1992. Solutions for the constrained dynamic facility layout problem. Eur. J. Oper. Res., 57(2):280–286. [doi:10.1016/0377-2217(92)90049-F]
Balakrishnan, J., Cheng, C.H., Conway, G., 2000. An improved pair wise exchange heuristic for the dynamic plant layout problem. Comput. Oper. Res., 27(6):587–593. [doi:10.1016/S0305-0548(99)00052-0]
Balakrishnan, J., Cheng, C.H., Conway, D.G., Lau, C.M., 2003. A hybrid genetic algorithm for the dynamic plant layout problem. Int. J. Prod. Econ., 86(2):107–120. [doi:10.1016/S0925-5273(03)00027-6]
Baykasoglu, A., Gindy, N.N.Z., 2001. A simulated annealing algorithm for the dynamic layout problem. Comput. Oper. Res., 28(14):1403–1426. [doi:10.1016/S0305-0548(00)00049-6]
Baykasoglu, A., Gindy, N.N.Z., 2004. Erratum to a simulated annealing algorithm for the dynamic layout problem. Comput. Oper. Res., 31(2):313–315. [doi:10.1016/S0305-0548(03)00205-3]
Conway, D.G., Venkataramanan, M.A., 1994. Genetic search and the dynamic facility layout problem. Comput. Oper. Res., 21(8):955–960. [doi:10.1016/0305-0548(94)90023-X]
Erel, E., Ghosh, J.B., Simon, J.T., 2003. New heuristic for the dynamic layout problem. J. Oper. Res. Soc., 54(12): 1275–1282. [doi:10.1057/palgrave.jors.2601646]
Kaku, B., Mazzola, J.B., 1997. A tabu-search heuristic for the plant layout problem. INFORMS J. Comput., 9(4):374–384. [doi:10.1287/ijoc.9.4.374]
Kennedy, J., Eberhart, R.C., 1995. Particle Swarm Optimization. Proc. IEEE Int. Conf. on Neural Networks, 4:1942–1948. [doi:10.1109/ICNN.1995.488968]
Kennedy, J., Eberhart, R.C., 1997. A Discrete Binary Version of the Particle Swarm Algorithm. Proc. World Multi-Conf. on Systemics, Cybernetics and Informatics, p.4104–4109.
Kennedy, J., Eberhart, R.C., Shi, Y., 2001. Swarm Intelligence. Morgan Kaufmann, San Francisco, CA.
Kulturel-Konak, S., 2007. Approaches to uncertainties in the facility layout problems: perspectives at the beginning of the 21th century. J. Intell. Manuf., 18(2):273–284. [doi:10.1007/s10845-007-0020-1]
Lacksonen, T.A., Enscore, E.E., 1993. Quadratic assignment algorithms for the dynamic layout problem. Int. J. Prod. Res., 31(3):503–517. [doi:10.1080/00207549308956741]
Liao, C.J., Tseng, C.T., Luarn, P., 2007. A discrete version of particle swarm optimization for flowshop scheduling problems. Comput. Oper. Res., 34(10):3099–3111. [doi:10.1016/j.cor.2005.11.017]
McKendall, A.R.Jr., Shang, J., 2006. Hybrid ant systems for the dynamic facility layout problem. Comput. Oper. Res., 33(3):790–803. [doi:10.1016/j.cor.2004.08.008]
McKendall, A.R.Jr., Shang, J., Kuppusamy, S., 2006. Simulated annealing heuristics for the dynamic facility layout problem. Comput. Oper. Res., 33(8):2431–2444. [doi:10.1016/j.cor.2005.02.021]
Onwubolu, G.C., 2002. Emerging Optimization Techniques in Production Planning and Control. Imperial College Press, London.
Poli, R., Kennedy, J., Blackwell, T., 2007. Particle swarm optimization. Swarm Intell., 1(1):33–57. [doi:10.1007/s11721-007-0002-0]
Rosenblatt, M.J., 1986. The dynamics of plant layout. Manag. Sci., 32(1):76–86. [doi:10.1287/mnsc.32.1.76]
Shi, Y., Eberhart, R.C., 1998. A Modified Particle Swarm Optimizer. Proc. IEEE Congress on Evolutionary Computation, p.169–173.
Shore, R.H., Tompkins, J.A., 1980. Flexible facilities design. IIE Trans., 12(2):200–205.
Tompkins, J.A., White, J.A., Bozer, Y.A., Frazelle, E.H., Tanchoco, J.M.A., Trevino, J., 1996. Facilities Planning. Wiley, New York.
Tseng, C.T., Liao, C.J., 2008. A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Int. J. Prod. Res., 46(17):4655–4670. [doi:10.1080/00207540701294627]
Urban, T.L., 1993. A heuristic for the dynamic layout problem. IIE Trans., 25(4):57–63. [doi:10.1080/07408179308964304]
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rezazadeh, H., Ghazanfari, M., Saidi-Mehrabad, M. et al. An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem. J. Zhejiang Univ. Sci. A 10, 520–529 (2009). https://doi.org/10.1631/jzus.A0820284
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/jzus.A0820284