A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem

International Journal of Production Research

Volumn 47, Issue 24, 2009, Pages 6855-6873

  Sahin, Ramazan ^a   Turkbey, Orhan ^a  

^a GAZI UNIVERSITY   (Turkey)

Author keywords

Dynamic facility layout problem; Hybrid meta heuristics; Simulated annealing; Tabu list

Indexed keywords

DATA SETS; DYNAMIC FACILITY LAYOUT PROBLEM; FACILITY LAYOUT; GLOBAL COMPETITION; HYBRID HEURISTICS; HYBRID METAHEURISTICS; MARKET CONDITION; MATERIAL HANDLING; PLANNING HORIZONS; RAPID CHANGES; SA ALGORITHM; TABU LIST; TABU SEARCH ALGORITHMS; TABU-SIMULATED ANNEALING;

ALGORITHMS; ANNEALING; HEURISTIC METHODS; MATERIALS HANDLING; PLANT LAYOUT; PROBLEM SOLVING; TABU SEARCH;

SIMULATED ANNEALING;

EID: 74549221427     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802376323     Document Type: Article

References (26)

1. Altiparmak, F. and Karaoglan, I., 2008. An adaptive tabu-simulated annealing for concave cost transportation problems. Journal of the Operational Research Society, 59 (3), 331-341.
2. Balakrishnan, J. and Cheng, C.H., 1998. Dynamic layout algorithms: a state-of-the-art survey. OMEGA, 26 (4), 507-521.
3. Balakrishnan, J. and Cheng, C.H., 2000. Genetic search and the dynamic layout problem. Computers and Operations Research, 27 (6), 587-593.
4. Balakrishnan, J., Cheng, C.H., and Conway, D.G., 2000. An improved pair-wise exchange heuristic for the dynamic plant layout problem. International Journal of Production Research, 38 (13), 3067-3077.
5. Balakrishnan, J., et al., 2003. A hybrid genetic algorithm for the dynamic plant layout problem. International Journal of Production Economics, 86 (2), 107-120.
6. Baykasoǧlu, A. and Gindy, N.N.Z., 2001. A simulated annealing algorithm for dynamic layout problem. Computers and Operations Research, 28 (14), 1403-1426.
7. Chiang, W.-C. and Chiang, C., 1998. Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation. European Journal of Operational Research, 106 (2), 457-488.
8. Conway, D.G. and Venkataramanan, M.A., 1994. Genetic search and the dynamic facility layout problem. Computers and Operations Research, 21 (8), 955-960.
9. Elmohamed, S., Fox, G., and Coddington, P., 1998. A comparison of annealing techniques for academic course scheduling. In: Proceedings of the 2nd international conference on the practice and theory of automated timetabling, 4 April, Syracuse, New York, 146-166.
10. Erel, E., Ghosh, J.B., and Simon, J.T., 2003. New heuristic for the dynamic layout problem. Journal of the Operational Research Society, 54 (12), 1275-1282.
11. Glover, F., 1986. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13 (5), 533-549.
12. Glover, F. and Kochenberger, G.A., 2002. Handbook of Metaheuristics. Norwell, MA: Kluwer Academic Publishers.
13. Kaku, B.K. and Mazzola, J.B., 1997. A tabu-search heuristic for the dynamic plant layout problem. INFORMS Journal on Computing, 9 (4), 374-384.
14. Kirkpatrick, S., Gelatt Jr. C.D., and Vecchi, M.P., 1983. Optimization by simulated annealing. Science, 220 (4598), 671-680.
15. Kusiak, A. and Heragu, S.S., 1987. The facility layout problem. European Journal of Operational Research, 29 (3), 229-251.
16. Lacksonen, T.A. and Enscore, E.E., 1993. Quadratic assignment algorithms for the dynamic layout problem. International Journal of Production Research, 31 (3), 503-517.
17. McKendall Jr. A.R. and Shang, J., 2006. Hybrid ant systems for the dynamic facility layout problem. Computers and Operations Research, 33 (3), 790-803.
18. McKendall Jr. A.R., Shang, J., and Kuppusamy, S., 2006. Simulated annealing heuristics for the dynamic facility layout problem. Computers and Operations Research, 33 (8), 2431-2444.
19. Meller, R.D. and Gau, K.-Y., 1996. The facility layout problem: recent and emerging trends and perspectives. Journal of Manufacturing Systems, 15 (5), 351-366.
20. Rodriguez, J.M., et al., 2006. Solving the dynamic plant layout problem using a new hybrid meta-heuristic algorithm. International Journal of High Performance Computing and Networking, 4 (5/6), 286-294.
21. Rosenblatt, M.J., 1986. The dynamics of plant layout. Management Science, 32 (1), 76-86.
22. Swarnkar, R. and Tiwari, M.K., 2004. Modeling machine loading problem of FMSs and its solution methodology using a hybrid tabu search and simulated annealing-based heuristic approach. Robotics and Computer-Integrated Manufacturing, 20 (3), 199-209.
23. Tompkins, J.A., et al., 1996. Facilities planning. New York: John Wiley & Sons.
24. Urban, T.L., 1993. A heuristic for the dynamic facility layout problem. IIE Transactions, 25 (4), 57-63.
25. Zhang, D. and Deng, A., 2005. An effective hybrid algorithm for the problem of packing circles into a larger containing circle. Computers and Operations Research, 32 (8), 1941-1951.
26. Zolfaghari, S. and Liang, M., 1999. Jointly solving the group scheduling and machining speed selection problems: a hybrid tabu search and simulated annealing approach. International Journal of Production Research, 37 (10), 2377-2397.