Coupling ant colony optimization and the extended great deluge algorithm for the discrete facility layout problem

Engineering Optimization

Volumn 39, Issue 8, 2007, Pages 953-968

  Nourelfath, M ^a   Nahas, N ^a   Montreuil, B ^a  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Ant colony optimization; Extended great deluge algorithm; Facilities layout; Hybridization; Meta heuristics; Quadratic assignment problem

Indexed keywords

GENETIC ALGORITHMS; PROBLEM SOLVING; SIMULATED ANNEALING; TABU SEARCH;

BUBBLE SEARCH; COMPARATIVE COMPUTATIONAL EXPERIMENTS; EXTENDED GREAT DELUGE (EGD); FACILITY LAYOUT PROBLEM (FLP); QUADRATIC ASSIGNMENT PROBLEM (QAP);

SYSTEMS ANALYSIS;

EID: 36249010378     PISSN: 0305215X     EISSN: 10290273     Source Type: Journal    
DOI: 10.1080/03052150701551461     Document Type: Article

References (71)

1. Afshar, M.H., Application of a max-min ant system to joint layout and size optimization of pipe networks. Eng. Optimiz, 2006, 38(3), 299-317.
2. Afshar, M.H. and Marino, M.A., Application of an ant algorithm for layout optimization of tree networks. Eng. Optimiz., 2006, 38(3), 353-369.
3. Anjos, M. and Vannelli, A., A new mathematical-programming framework for facility-layout design. INFORMS J. Comput., 2006, 18(1), 111-118.
4. Anstreicher, K.M. and Brixius, N.W., A new bound for the quadratic assignment problem, based on convex quadratic programming. Math. Programm., 2001a, 80(3), 341-357.
5. Anstreicher, K.M. and Brixius, N.W., Solving quadratic assignment problems using convex quadratic programming relaxations. Optimiz. Methods Softw., 2001b, 16(1), 49-68.
6. Anstreicher, K.M., Brixius, N.W., Goux, J.-P. and Linderoth, J., Solving large quadratic assignment problems on computational grids. J. Math. Programm, 2002, 91(3), 563-588.
7. Battiti, R. and Techiolli, G., The reactive tabu search. ORSA J. Comput., 1994, 6(2), 126-140.
8. Bauer, A., Bullnheimer, B., Haiti, R.F. and Strauss, C., Minimizing total tardiness on a single machine using ant colony optimization. Central Eur. J. Operat. Res., 2000, 8(2), 125-141.
9. Bazara, M.S. and Sherali, M.D., Benders' partitioning schema applied to a new formulation of the quadratic assignment problem. Naval Res. Logis. Quart., 1980, 27(1), 29-41.
10. Besteo, M.D., Stützle, T. and Dorigo, M., Ant colony optimization for the total weighted tardiness problem, in 6th International Conference on Parallel Problem Solving From Nature (PPSN VI), 2000, pp. 611-620.
11. Bland, J.A., Space-planning by ant colony optimization. Int. J. Comput. Appl. Technol., 1999a, 12(6), 320-328.
12. Bland, J.A., Layout of facilities using an ant system approach. Eng. Optimiz., 1999b, 32(1), 101-115.
13. Bmengger, A., Clausen, J., Marzetta, A. and Perregaard, M., Joining Fortes in Solving Large-Scale Quadratic Assignment Problems in, Parallel. University of Copenhagen, DIKU Technical Report, 1996.
14. Bullnheimer, B., Hartl, R.F. and Strauss, C., Applying the ant system to the vehicle routing problem, in 2nd Metaheuristics International Conference, 1997, pp. 21-24.
15. Burkard, R.E., Quadratic assignment problems. Eur: J. Operat. Res., 1984, 15(3), 283-289.
16. Burkard, R.E. and Bonniger, T., A heuristic for quadratic Boolean programs with applications to quadratic assignment problems. Eur. J. Operat. Res., 1983, 13(4), 374-386.
17. Burkard, R.E., Karisch, S. and Rendl, F., QAPLIB-A quadratic assignment problem, library. Eur. J. Operat. Res., 1991, 55(1), 115-119.
18. Burkard, R.E. and Rendl, F., A thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur: J. Operat. Res., 1984, 17(2), 169-174.
19. Burke, E.K., Bykov, Y., Newall, J.P. and Petrovic, S., A New Local Search Approach with Execution Time as an Input Parameter: University of Nottingham, Computer Science Technical Report No. NOTTCS-TR-2002-3, 2002.
20. Burke, E.K., Bykov, Y., Newall, J.P. and Petrovic, S., A time-predefined local search, approach to exam timetabling problems. HE Trans., 2004, 36(6), 509-528.
21. Chan, K.C. and Tansri, H., A study of genetic crossover operations on the- facilities layout problem.. Comput. Indust. Eng., 1994, 26(3), 537-550.
22. Clausen, J. and Perregaard, M., Solving large quadratic assignment problems in parallel. Comput. Optimiz. Applic., 1997, 8(2), 11-127.
23. Colorni, A., Dorigo, M., Maniezzo, V. and Trubian, M., Ant system for job-shop scheduling. JORBEL-Belgian J. Operat. Res. Stat. Comput. Sci., 1994, 34(1), 39-53.
24. Connolly, D.T., An improved annealing scheme for the QAP. Eur: J. Operat. Res., 1990, 46(1), 93-100.
25. Costa, D. and Hertz, A., Ants can color graphs. J. Operat. Res. Soc., 1997, 48(3), 295-305.
26. Cung, V.-D., Mautor, T., Michelon, P. and Tavares, A., A scatter search based approach, for the quadratic assignment problem, in IEEE ICEC'97 Conference, 1997, pp. 165-170.
27. Di Caro, G. and Dorigo, M., Mobile agents for adaptive routing, in 31st Hawaii International Conference on System Sciences, 1998, pp. 74-83.
28. Denebourg, J.L., Pasteels, J.M. and Verhaeghe, J.C., Probabilistic behaviour in ants: a strategy of errors. J. Theoret. Biol., 1983, 105(2), 259-271.
29. Dorigo, M., Maniezzo, V. and Colorni, A., The ant system: optimization by a colony of cooperating agents. IEEE Trans. Systems, Man Cybernet. B, 1996, 26(1), 1-13.
30. Dorigo, M., and Gambardella, L.M., Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolution. Comput., 1997a, 1(1), 53-66.
31. Dorigo, M., and Gambardella, L.M., Ant colonies for the travelling salesman problem. BioSystems, 1997b, 43, 73-81.
32. Dorigo, M. and Stutzle, T., The ant colony optimization metaheuristic: algorithms, applications and advances. In Handbook ofMeta-heuristics, edited by F. Glover and G. Kochenberger, pp. 251-285, 2001 (Kluwer Academic : Boston).
33. Elshafei, A.E., Hospital layout as a quadratic assignment problem. OR Quart., 1977, 28(1), 167-179.
34. Fleurent, C. and Ferland, J., Genetic hybrids for the quadratic assignment problem. DIMACS Ser: Math. Theoret. Comput. Sci., 1994, 16(1), 190-206.
35. Gambardella, L.M. and Dorigo, M., HAS-SOP: Ant Colony Optimization for Sequential Ordering Problems. IDSIA, Lugano, Switzerland, Technical Report IDSIA-11-97, 1997.
36. Gambardella, L.M., Taillard, E.D. and Dorigo, M., Ant colonies for die QAP. J. Opemt. Res. Soc., 1999, 50(2), 167-176.
37. Hahn, P., Grant, T. and Hall, N., A branch-and-bound algorithm, for the quadratic assignment problem, based on the Hungarian method. Eur: J. Operat. Res., 1998, 108(3), 629-640.
38. Hahn, P., Hightower, W.L., Johnson., TA., Guignard-Spielberg, M. and Roucairol, C., Tree elaboration strategies in branch and bound algorithms for solving the quadratic assignment problem. Yugoslav. J. Opemt. Res., 2001, 11(1), 41-60.
39. Herargu, S.S. and Alfa, A.S., Experimental analysis of simulated annealing based algorithms for the layout problem. Eur. J. Operat. Res., 1992, 57(2), 190-202.
40. Kaku, B.K. and Thompson, G.L., Comment on 'A perturbation scheme to improve Hillier's solution to the facilities layout problem'. Manage. Sci., 1986, 32(2), 251-252.
41. Koopmans, T.C. and Beckmann, M.J., Assignment problems and the location of economic activities. Econometrica, 1957, 25(1), 53-76.
42. Kusiak, A. and Heragu, S.S., The facility layout problem. Eur: J. Operat. Res., 1987, 29(3), 229-251.
43. Lawler, E., The quadratic assignment problem. Manag. Sci., 1963, 9(4), 586-599.
44. Liang, Y.C. and Smith, A.E., An ant colony optimization algorithm for the redundancy allocation problem. IEEE Trans. Reliability, 2004, 53(3), 417-423.
45. Maniezzo, V. and Colorni, A., The ant system applied to the quadratic assignment problem. IEEE Trans. Knowl. Data Eng., 1999, 11(5), 769-778.
46. Maniezzo, V., Colorni, A. and Dorigo, M., The Ant System Applied to the Quadratic Assignment Problem. IRIDA, Université de Bruxelles, Technical Report 94/28, 1994.
47. Maniezzo, V., Colorni, A. and Dorigo, M., Algodesk: an experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem. Eur: J. Operat. Res., 1995, 81(1), 188-205.
48. Mans, B., Mautor, T. and Roucairol, C., A parallel depth first search branch and bound algorithm, for the quadratic assignment problem. Eur: J. Operet. Res., 1995, 81(3), 617-628.
49. Mautor, T., Contribution, à la résolution des problèmes d'implanation: algorithmes séquentiels et parallèles pour l'affectation quadratique.PhD thesis, Université Pierre et Marie Curie, Paris, 1992.
50. McKendall Jr., A.R. and Shang, J., Hybrid ant systems for the dynamic facility layout problem. Comput. Operat. Res., 2006, 33(3), 790-803.
51. Meller, R.D. and Gau, K.-Y., The facility layout problem: recent and emerging trends and perspectives. J. Manufact. Syst., 1996, 15(5), 351-366.
52. Montreuil, B., A modelling framework for integrating layout design and flow network design. In Progress in Material Handling and Logistics, Vol. 2, edited by J.A.White and W. Pence, pp. 95-116, 1991 (Springer-Verlag: USA).
53. Montreuil, B., Ouazzani, N., Brotherton, E. and Nourelfath, M., AntZone layout metaheuristic: coupling zone-based layout optimization, ant colony system and domain knowledge. In Progress in Material Handling Research, pp. 301-331, 2004 (Material Handling Institute of America: USA).
54. Nahas, N. and Nourelfath, M., Ant system for reliability of a series system with multiple-choice and budget constraints. Reliabil. Eng. System Safety, 2005, 87(1), 1-12.
55. Nahas, N., Nourelfath, M. and Ait-Kadi, D., Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem, of series-parallel systems. Reliabil. Eng. System Safety, 2007, 92(2), 211-222.
56. Nugent, C.E., Vollman, TE. and Ruml, J., An experimental comparison of techniques for the assignment of techniques to locations. Operat. Res., 1968, 16(1), 150-173.
57. Pirlot, M. and Teghem, J. (eds), Résolution de problèmes de RO par les métaheuristiques. In Informatique et Systèmes d'Information, Ch. 3, 2002, (Hermes: Lavoisier).
58. Schoofs, L. and Naudts, B., Ant colonies are good at solving constraint satisfaction problems, in 2000 Congmss on Evolutionary Computation, 2000, pp. 1190-1195.
59. Shani, S. and Gonzalez, T., P-complete approximations problems. J. ACM, 1976, 23(1), 555-565.
60. Skorin-Kapov, J., Tabu search applied to the quadratic assignment problem. ORSA J. Comput., 1990, 2(1), 33-45.
61. Solimanpur, M., Vrat, P. and Shankar, R. Ant colony optimization to the inter-cell layout problem in cellular manufacturing. Eur: J. Operat. Res., 2003, 157(3), 592-606.
62. Sondergeld, L. and Voß, S., A. star-shaped diversification, approach in tabu search. In Meta-Heuristics: Theory and Applications, edited by I.H. Osman and J.P. Kelly, pp. 489-502, 1996 (Kluwer: Dordnecht).
63. Stützle, Th., Iterated Local Search for the Quadratic Assignment Problem. Darmstadt University of Technology, Research Report AIDA-99-3, 1999.
64. Stützte, Th. and Dorigo, M., A short convergence proof for a class of ant colony optimization algorithms. IEEE Trans. Evolution. Comput., 2002, 6(4), 358-365.
65. Tate, D.M. and Smith, A.E., A genetic approach to the quadratic assignment problem. Comput. Operat. Res., 1995, 22(1), 73-83.
66. Taillard, E.D., Robust taboo search for the quadratic assignment problem. Parallel Comput., 1991, 17(4-5), 443-455.
67. Thelma, D.M. and Panos, M.P., Simulated annealing and genetic algorithms for the facility layout problem.: a survey. Comput. Optimiz. Applic., 1997, 7(1), 111-126.
68. Wagner, I.A. and Bruckstein, A.M., Hamiltonian(t)-an ant inspired heuristic for recognizing Hamiltonian graphs, in 1999 Congress on Evolutionary Computation, 1999, pp. 1465-1469.
69. Wang, S. and Sarker, B.R., Locating cells with bottleneck machines in cellular manufacturing systems. Int. J. Product. Res., 2002, 40(2), 403-424.
70. Wilhelm., M.R. and Ward, T.L., Solving quadratic assignment problems by simulated annealing. HE Trans., 1987, 3(1), 107-119.
71. Zhao, F. and Zeng, X., Optimization of transit network layout and headway with a combined genetic algorithm and simulated annealing method. Eng. Optimiz., 2006, 38(6), 701-722.