Fast simulated annealing for single-row equidistant facility layout

Applied Mathematics and Computation

Volumn 263, Issue , 2015, Pages 287-301

  Palubeckis, Gintaras ^a  

^a KAUNAS UNIVERSITY OF TECHNOLOGY   (Lithuania)

Author keywords

Combinatorial optimization; Quadratic assignment; Simulated annealing; Single row facility layout

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; PLANT LAYOUT; SIMULATED ANNEALING; TABU SEARCH;

COMPUTATIONAL RESULTS; EXPERIMENTAL ANALYSIS; FACILITY LAYOUT; FACILITY LAYOUT PROBLEMS; FAST SIMULATED ANNEALING; QUADRATIC ASSIGNMENT; SIMULATED ANNEALING ALGORITHMS; TRADITIONAL APPROACHES;

ITERATIVE METHODS;

EID: 84929192783     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2015.04.073     Document Type: Article

References (44)

1. W.P. Adams, M. Guignard, P.M. Hahn, and W.L. Hightower A level-2 reformulation-linearization technique bound for the quadratic assignment problem Eur. J. Oper. Res. 180 3 2007 983 996
2. H. Ahonen, A.G. de Alvarenga, and A.R.S. Amaral Simulated annealing and tabu search approaches for the corridor allocation problem Eur. J. Oper. Res. 232 1 2014 221 233
3. A.R.S. Amaral The corridor allocation problem Comput. Oper. Res. 39 12 2012 3325 3330
4. N.A.G. Aneke, and A.S. Carrie A design technique for the layout of multi-product flowlines Int. J. Prod. Res. 24 3 1986 471 481
5. M.F. Anjos, and G. Yen Provably near-optimal solutions for very large single-row facility layout problems Optim. Methods Softw. 24 4-5 2009 805 817
6. U. Benlic, and J.-K. Hao Breakout local search for the quadratic assignment problem Appl. Math. Comput. 219 9 2013 4800 4815
7. U. Benlic, and J.-K. Hao Memetic search for the quadratic assignment problem Expert Syst. Appl. 42 1 2015 584 595
8. J. Bhasker, and S. Sahni Optimal linear arrangement of circuit components J. VLSI Comput. Syst. 2 1-2 1987 87 109
9. R. Burkard, M. Dell'Amico, and S. Martello Assignment Problems 2009 SIAM
10. R.E. Burkard, and F. Rendl A thermodynamically motivated simulation procedure for combinatorial optimization problems Eur. J. Oper. Res. 17 2 1984 169 174
11. C.K. Cheng Linear placement algorithms and applications to VLSI design Networks 17 4 1987 439 464
12. W.-M. Chow An analysis of automated storage and retrieval systems in manufacturing assembly lines IIE Trans. 18 2 1986 204 214
13. J. Díaz, J. Petit, and M. Serna A survey of graph layout problems ACM Comput. Surv. 34 3 2002 313 356
14. Z. Drezner Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem Comput. Oper. Res. 35 3 2008 717 736
15. P.M. Hahn, Y.-R. Zhu, M. Guignard, W.L. Hightower, and M.J. Saltzman A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem INFORMS J. Comput. 24 2 2012 202 209
16. S.S. Heragu, and A.S. Alfa Experimental analysis of simulated annealing based algorithms for the layout problem Eur. J. Oper. Res. 57 2 1992 190 202
17. P. Hungerländer Single-row equidistant facility layout as a special case of single-row facility layout Int. J. Prod. Res. 52 5 2014 1257 1268
18. P. Hungerländer, and F. Rendl A computational study and survey of methods for the single-row facility layout problem Comput. Optim. Appl. 55 1 2013 1 20
19. M.S. Hussin, and T. Stützle Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances Comput. Oper. Res. 43 2014 286 291
20. T. James, C. Rego, and F. Glover A cooperative parallel tabu search algorithm for the quadratic assignment problem Eur. J. Oper. Res. 195 3 2009 810 826
21. T. James, C. Rego, and F. Glover Multistart tabu search and diversification strategies for the quadratic assignment problem IEEE Trans. Syst. Man Cybern. A: Syst. Humans 39 3 2009 579 596
22. R.M. Karp, and M. Held Finite-state processes and dynamic programming SIAM J. Appl. Math. 15 3 1967 693 718
23. T.C. Koopmans, and M. Beckmann Assignment problems and the location of economic activities Econometrica 25 1 1957 53 76
24. R. Kothari, and D. Ghosh The single row facility layout problem: state of the art OPSEARCH 49 4 2012 442 462
25. R. Kothari, and D. Ghosh A scatter search algorithm for the single row facility layout problem J. Heuristics 20 2 2014 125 142
26. P. Kouvelis, W.-C. Chiang, and G. Yu Optimal algorithms for row layout problems in automated manufacturing systems IIE Trans. 27 1 1995 99 104
27. E.M. Loiola, N.M.M. de Abreu, P.O. Boaventura-Netto, P. Hahn, and T. Querido A survey for the quadratic assignment problem Eur. J. Oper. Res. 176 2 2007 657 690
28. T.D. Mavridou, and P.M. Pardalos Simulated annealing and genetic algorithms for the facility layout problem: a survey Comput. Optim. Appl. 7 1 1997 111 126
29. T. Obata Quadratic assignment problem: evaluation of exact and heuristic algorithms (Dissertation) 1979 Rensselaer Polytechnic Institute Troy, NY
30. G. Palubeckis A branch-and-bound algorithm for the single-row equidistant facility layout problem OR Spectr. 34 1 2012 1 21
31. G. Paul Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem Oper. Res. Lett. 38 6 2010 577 581
32. J.-C. Picard, and M. Queyranne On the one-dimensional space allocation problem Oper. Res. 29 2 1981 371 391
33. E. Rodriguez-Tello, J.-K. Hao, and J. Torres-Jimenez An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem Comput. Oper. Res. 35 10 2008 3331 3346
34. R.A. Rutenbar Simulated annealing algorithms: an overview IEEE Circuits Devices Mag. 5 1 1989 19 26
35. I. Safro, D. Ron, and A. Brandt Graph minimum linear arrangement by multilevel weighted edge contractions J. Algorithms 60 1 2006 24 41
36. B.R. Sarker The amoebic matrix and one-dimensional machine location problems (Dissertation), Department of Industrial Engineering 1989 Texas A&M University, College Station TX
37. B.R. Sarker, W.E. Wilhelm, and G.L. Hogg One-dimensional machine location problems in a multi-product flowline with equidistant locations Eur. J. Oper. Res. 105 3 1998 401 426
38. J. Skorin-Kapov Tabu search applied to the quadratic assignment problem ORSA J. Comput. 2 1 1990 33 45
39. J. Sun, Q. Zhang, and X. Yao Meta-heuristic combining prior online and offline information for the quadratic assignment problem IEEE Trans. Cybern. 44 3 2014 429 444
40. J.K. Suryanarayanan, B.L. Golden, and Q. Wang A new heuristic for the linear placement problem Comput. Oper. Res. 18 3 1991 255 262
41. E. Taillard Robust taboo search for the quadratic assignment problem Parallel Comput. 17 4-5 1991 443 455
42. U. Tosun, T. Dokeroglu, and A. Cosar A robust island parallel genetic algorithm for the quadratic assignment problem Int. J. Prod. Res. 51 14 2013 4117 4133
43. S. Wang, and B.R. Sarker Locating cells with bottleneck machines in cellular manufacturing systems Int. J. Prod. Res. 40 2 2002 403 424
44. J. Yu, and B.R. Sarker Directional decomposition heuristic for a linear machine-cell location problem Eur. J. Oper. Res. 149 1 2003 142 184