Full Text:   <3291>

CLC number: TP273

On-line Access: 

Received: 2008-04-15

Revision Accepted: 2008-01-16

Crosschecked: 2009-01-08

Cited: 23

Clicked: 4039

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
1. Reference List
Open peer comments

Journal of Zhejiang University SCIENCE A 2009 Vol.10 No.4 P.520~529

10.1631/jzus.A0820284


An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem


Author(s):  Hassan REZAZADEH, Mehdi GHAZANFARI, Mohammad SAIDI-MEHRABAD, Seyed JAFAR SADJADI

Affiliation(s):  Department of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran

Corresponding email(s):   hassan.rezazadeh@gmail.com

Key Words:  Dynamic facility layout problem (DFLP), Particle swarm optimization (PSO), Optimization, Heuristic method


Hassan REZAZADEH, Mehdi GHAZANFARI, Mohammad SAIDI-MEHRABAD, Seyed JAFAR SADJADI. An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem[J]. Journal of Zhejiang University Science A, 2009, 10(4): 520~529.

@article{title="An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem",
author="Hassan REZAZADEH, Mehdi GHAZANFARI, Mohammad SAIDI-MEHRABAD, Seyed JAFAR SADJADI",
journal="Journal of Zhejiang University Science A",
volume="10",
number="4",
pages="520~529",
year="2009",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.A0820284"
}

%0 Journal Article
%T An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem
%A Hassan REZAZADEH
%A Mehdi GHAZANFARI
%A Mohammad SAIDI-MEHRABAD
%A Seyed JAFAR SADJADI
%J Journal of Zhejiang University SCIENCE A
%V 10
%N 4
%P 520~529
%@ 1673-565X
%D 2009
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.A0820284

TY - JOUR
T1 - An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem
A1 - Hassan REZAZADEH
A1 - Mehdi GHAZANFARI
A1 - Mohammad SAIDI-MEHRABAD
A1 - Seyed JAFAR SADJADI
J0 - Journal of Zhejiang University Science A
VL - 10
IS - 4
SP - 520
EP - 529
%@ 1673-565X
Y1 - 2009
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.A0820284


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.

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Reference

[1] Armour, G.C., Buffa, E.S., 1963. A heuristic algorithm and simulation approach to relative allocation of facilities. Manag. Sci., 9(2):294-300.

[2] Balakrishnan, J., Cheng, C.H., 1998. Dynamic layout algorithms: a state-of-the-art survey. Omega, Int. J. Manag. Sci., 26(4):507-521.

[3] Balakrishnan, J., Cheng, C.H., 2000. Genetic search and the dynamic layout problem. Comput. Oper. Res., 27(6):587-593.

[4] 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.

[5] 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.

[6] 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.

[7] Baykasoglu, A., Gindy, N.N.Z., 2001. A simulated annealing algorithm for the dynamic layout problem. Comput. Oper. Res., 28(14):1403-1426.

[8] 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.

[9] Conway, D.G., Venkataramanan, M.A., 1994. Genetic search and the dynamic facility layout problem. Comput. Oper. Res., 21(8):955-960.

[10] Erel, E., Ghosh, J.B., Simon, J.T., 2003. New heuristic for the dynamic layout problem. J. Oper. Res. Soc., 54(12):1275-1282.

[11] Kaku, B., Mazzola, J.B., 1997. A tabu-search heuristic for the plant layout problem. INFORMS J. Comput., 9(4):374-384.

[12] Kennedy, J., Eberhart, R.C., 1995. Particle Swarm Optimization. Proc. IEEE Int. Conf. on Neural Networks, 4:1942-1948.

[13] 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.

[14] Kennedy, J., Eberhart, R.C., Shi, Y., 2001. Swarm Intelligence. Morgan Kaufmann, San Francisco, CA.

[15] 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.

[16] Lacksonen, T.A., Enscore, E.E., 1993. Quadratic assignment algorithms for the dynamic layout problem. Int. J. Prod. Res., 31(3):503-517.

[17] 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.

[18] McKendall, A.R.Jr., Shang, J., 2006. Hybrid ant systems for the dynamic facility layout problem. Comput. Oper. Res., 33(3):790-803.

[19] 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.

[20] Onwubolu, G.C., 2002. Emerging Optimization Techniques in Production Planning and Control. Imperial College Press, London.

[21] Poli, R., Kennedy, J., Blackwell, T., 2007. Particle swarm optimization. Swarm Intell., 1(1):33-57.

[22] Rosenblatt, M.J., 1986. The dynamics of plant layout. Manag. Sci., 32(1):76-86.

[23] Shi, Y., Eberhart, R.C., 1998. A Modified Particle Swarm Optimizer. Proc. IEEE Congress on Evolutionary Computation, p.169-173.

[24] Shore, R.H., Tompkins, J.A., 1980. Flexible facilities design. IIE Trans., 12(2):200-205.

[25] Tompkins, J.A., White, J.A., Bozer, Y.A., Frazelle, E.H., Tanchoco, J.M.A., Trevino, J., 1996. Facilities Planning. Wiley, New York.

[26] 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.

[27] Urban, T.L., 1993. A heuristic for the dynamic layout problem. IIE Trans., 25(4):57-63.

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - Journal of Zhejiang University-SCIENCE