GRASP with path relinking for the single row facility layout problem

Knowledge-Based Systems

Volumn 106, Issue , 2016, Pages 1-13

  Rubio Sánchez, Manuel ^a   Gallego, Micael ^a   Gortázar, Francisco ^a   Duarte, Abraham ^a  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

Author keywords

Facilities planning and design; GRASP; Metaheuristics; Path relinking

Indexed keywords

COMPUTATIONAL COMPLEXITY; MANUFACTURE; PLANT LAYOUT;

CONSTRUCTION PROCEDURES; FACILITIES PLANNING AND DESIGN; FACILITY LAYOUT PROBLEMS; GRASP; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; META HEURISTICS; PATH RELINKING; STATE-OF-THE-ART METHODS;

HEURISTIC ALGORITHMS;

EID: 84969964123     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.knosys.2016.05.030     Document Type: Article

References (53)

1. R.M. Aiex, M.G. Resende, and C.C. Ribeiro Ttt plots: a perl program to create time-to-target plots Optim. Lett. 1 4 2006 355 366 10.1007/s11590-006-0031-4
2. A.R. Amaral On the exact solution of a facility layout problem Eur. J. Operat. Res. 173 2 2006 508 518 10.1016/j.ejor.2004.12.021
3. A.R. Amaral An exact approach to the one-dimensional facility layout problem Operat. Res. 56 4 2008 1026 1033 10.1287/opre.1080.0548
4. A.R. Amaral A new lower bound for the single row facility layout problem Discrete Appl. Math. 157 1 2009 183 190 10.1016/j.dam.2008.06.002
5. A.R. Amaral, and A.N. Letchford A polyhedral approach to the single row facility layout problem Math. Program. 141 1-2 2013 453 477 10.1007/s10107-012-0533-z
6. M.F. Anjos, 2016. URL www.miguelanjos.com/flplib.
7. M.F. Anjos, and A. Vannelli Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes INFORMS J. Comput. 20 4 2008 611 617 10.1287/ijoc.1080.0270
8. 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 10.1080/10556780902917735
9. M.F. Anjos, A. Kennings, and A. Vannelli A semidefinite optimization approach for the single-row layout problem with unequal dimensions Discrete Optim 2 2 2005 113 122 10.1016/j.disopt.2005.03.001
10. V. Campos, R. Martí, J. Sanchez-Oro, and A. Duarte GRASP with PR for the orienteering problem J. Operational Res. Soc. 2013 10.1057/jors.2013.156
11. D. Datta, A.R. Amaral, and J.R. Figueira Single row facility layout problem using a permutation-based genetic algorithm Eur. J. Operat. Res. 213 2 2011 388 394 10.1016/j.ejor.2011.03.034
12. A. Duarte, R. Martí, M. Resende, and R. Silva GRASP with path relinking heuristics for the antibandwidth problem Networks 58 3 2011 171 189
13. T.A. Feo, M.G. Resende, and S.H. Smith A greedy randomized adaptive search procedure for maximum independent set Operat. Res. 42 1994 860 878
14. T.A. Feo, and M.G. Resende A probabilistic heuristic for a computationally difficult set covering problem Operat. Res. Lett. 8 1989 67 71 10.1016/0167-6377(89)90002-3
15. F. Glover Tabu search - part 1 ORSA J. Comput. 1 2 1989 190 206
16. F. Glover Tabu search - part 2 ORSA J. Comput. 2 1 1990 4 32
17. F. Glover, C. Kuo, and K. Dhir Heuristic algorithms for the maximum diversity problem J. Inform. Optim. Sci. 19 1 1998 109 132
18. F. Glover A template for scatter search and path relinking Selected Papers from the Third European Conference on Artificial Evolution 1998 Springer-Verlag 3 54
19. S.S. Heragu, and A.S. Alfa Experimental analysis of simulated annealing based algorithms for the layout problem Eur. J. Operat. Res. 57 2 1992 190 202 10.1016/0377-2217(92)90042-8
20. S.S. Heragu, and A. Kusiak Machine layout problem in flexible manufacturing systems Operat. Res. 36 2 1988 258 268 10.1287/opre.36.2.258
21. S.S. Heragu, and A. Kusiak Efficient models for the facility layout problem Eur. J. Operat. Res. 53 1 1991 1 13 10.1016/0377-2217(91)90088-D
22. 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 10.1080/00207543.2013.828163
23. 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 10.1007/s10589-012-9505-8
24. J.W. Hunt, and T.G. Szymanski A fast algorithm for computing longest common subsequences Commun. ACM 20 5 1977 350 353 10.1145/359581.359603
25. B. Keller, and U. Buscher Single row layout models Eur. J. Operat. Res. 245 3 2015 629 644 10.1016/j.ejor.2015.03.016
26. R. Kothari, and D. Ghosh The single row facility layout problem: state of the art OPSEARCH 49 4 2012 442 462 10.1007/s12597-012-0091-4
27. R. Kothari, and D. Ghosh Path relinking for single row facility layout Technical Report, 2012-05-01 2012 Indian Institute of Management
28. R. Kothari, and D. Ghosh Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods Technical Report, 2012-01-03 2012 Indian Institute of Management
29. R. Kothari, and D. Ghosh Insertion based lin-kernighan heuristic for single row facility layout Comput. Operat. Res. 40 1 2013 129 136 10.1016/j.cor.2012.05.017
30. R. Kothari, and D. Ghosh Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods Eur. J. Operat. Res. 224 1 2013 93 100 10.1016/j.ejor.2012.07.037
31. R. Kothari, and D. Ghosh An efficient genetic algorithm for single row facility layout Optim. Lett. 8 2 2014 679 690 10.1007/s11590-012-0605-2
32. R. Kothari, and D. Ghosh A scatter search algorithm for the single row facility layout problem J. Heuristics 20 2 2014 125 142 10.1007/s10732-013-9234-x
33. K.R. Kumar, G.C. Hadjinicola, and T. li Lin A heuristic procedure for the single-row facility layout problem Eur. J. Operat. Res. 87 1 1995 65 73 10.1016/0377-2217(94)00062-H
34. S. Kumar, A.P. Kumanan, and S. Varma Scatter search algorithm for single row layout problem in FMS Adv. Prod. Eng. & Manag. 3 4 2008 193 204
35. M. Laguna, and R. Martí GRASP and path relinking for 2-layer straight line crossing minimization INFORMS J. Comput. 11 1 1999 44 52
36. P. Larrañaga, C.M. Kuijpers, R.H. Murga, I. Inza, and S. Dizdarevic Genetic algorithms for the travelling salesman problem: a review of representations and operators Artif. Intell. Rev. 13 2 1999 129 170
37. R.F. Love, and J.Y. Wong On solving a one-dimensional space allocation problem with integer programming INFOR: Inform. Syst. Operat. Res. 14 1976 139û 144
38. J. Pantrigo, R. Martí, A. Duarte, and E. Pardo Scatter search for the cutwidth minimization problem Ann. Operat. Res. 199 1 2012 285 304
39. J.-C. Picard, and M. Queyranne On the one-dimensional space allocation problem Operat. Res. 29 2 1981 371 391 10.1287/opre.29.2.371
40. A.S. Ramkumar, and S.G. Ponnambalam Design of single-row layouts for flexible manufacturing systems using genetic algorithm and simulated annealing algorithm 2004 IEEE Conference on Cybernetics and Intelligent Systems 2 2004 1143 1147 10.1109/ICCIS.2004.1460751
41. M.G. Resende, R. Martí, M. Gallego, and A. Duarte GRASP and path relinking for the max-min diversity problem Comput. Operat. Res. 37 3 2010 498 508
42. M.G. Resende, and C.C. Ribeiro Greedy randomized adaptive search procedures: advances, hybridizations, and applications M. Gendreau, J.-Y. Potvin, Handbook of Metaheuristics 2nd International Series in Operations Research & Management Science 146 2010 Springer US 283 319
43. M.G. Resende, and C.C. Ribeiro GRASP: Greedy randomized adaptive search procedures E. Burke, G. Kendall, Search Methodologies 2014 Springer US 287 312
44. M.G. Resende, and R.F. Werneck A hybrid heuristic for the p-median problem J. Heuristics 10 1 2004 59 88
45. D. Romero, and A. Sánchez-Flores Methods for the one-dimensional space allocation problem Comput. Operat. Res. 17 5 1990 465 473 10.1016/0305-0548(90)90051-8
46. M. Rubio-Sánchez, M. Gallego, F. Gortázar, A. Duarte, 2016. URL www.optsicom.es/srflp/.
47. H. Samarghandi, and K. Eshghi An efficient tabu algorithm for the single row facility layout problem Eur. J. Operat. Res. 205 1 2010 98 105 10.1016/j.ejor.2009.11.034
48. H. Samarghandi, P. Taabayan, and F.F. Jahantigh A particle swarm optimization for the single row facility layout problem Comput. Ind. Eng. 58 4 2010 529 534 10.1016/j.cie.2009.11.015
49. S. Sanjeevi, and K. Kianfar A polyhedral study of triplet formulation for single row facility layout problem Discrete Appl. Math. 158 16 2010 1861 1867 10.1016/j.dam.2010.07.005
50. M. Sevaux, and K. Sörensen Permutation distance measures for memetic algorithms with population managment MIC2005, Proceedings of 6th Metaheuristics International Conference 2005 832 838
51. D.M. Simmons One-dimensional space allocation: An ordering algorithm Operat. Res. 17 5 1969 812 826 10.1287/opre.17.5.812
52. M. Solimanpur, P. Vrat, and R. Shankar An ant algorithm for the single row layout problem in flexible manufacturing systems Comput. Operat. Res. 32 3 2005 583 598 10.1016/j.cor.2003.08.005
53. S.M. Ulam Some ideas and prospects in biomathematics Annu. Rev. Biophys. Bioeng. 1 1972 277 292 10.1146/annurev.bb.01.060172.001425