An hybrid fuzzy variable neighborhood particle swarm optimization algorithm for solving quadratic assignment problems

Journal of Universal Computer Science

Volumn 13, Issue 9, 2007, Pages 1309-1331

  Liu, Hongbo ^a   Abraham, Ajith ^b  

^a DALIAN MARITIME UNIVERSITY   (China)

^b NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

Particle swarm optimization; Quadratic assignment problem; Variable neighborhood search

Indexed keywords

EID: 36649032121     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article

References (99)

1. Abraham A., Guo H., Liu H.: "Swarm Intelligence: Foundations, Perspectives and Applications" ; "Swarm Intelligent Systems, Studies in Computational Intelligence, Chapter 1" (Nedjah, N., Mourelle, L. eds.), Springer (2006), 3-25
2. Abraham A., Liu H., Zhang W.: "Scheduling Job on Computational Grids Using Fuzzy Particle Swarm Algorithm"; "Proceedings of the Tenth International Conference on Knowledge-Based & Intelligent Information & Engineering Systems, KES 2006", Lecture Notes in Artificial Intelligence, 4252(2006), 500-507
3. Abraham A., Nedjah N., Mourelle L.: "Evolutionary Computation: From Genetic Algorithms to Genetic Programming" ; "Studies in Computational Intelligence" (Nedjah N. et al. eds.), Springer (2006), 1-20
4. Ahuja R., Orlin J. B., Tiwari A.: "A Greedy Genetic Algorithm for the Quadratic Assignment Problem"; Computers and Operations Research, 27, 10(2000), 917-934
5. Angel E., Zissimopoulos V.: "On the Quality of Local Search for the Quadratic Assignment Problem" ; Discrete Applied Mathematics, 82, 1-3(1998), 15-25
6. Angel E., Zissimopoulos V.: "On the Hardness of the Quadratic Assignment Problem with Metaheuristics" ; Journal of Heuristics, 8(2002), 399-414
7. Anstreicher K., Brixius N., Goux J.-P., Linderoth J.: "Solving Large Quadratic Assignment Problems on Computational Grids"; Mathematical Programming, Serial B, 91(2002), 563-588
8. Anstreicher K. M.: "Recent Advances in the Solution of Quadratic Assignment Problems"; Mathematical Programming, 97, 1-2(2003), 27-42
9. Arkin E. M., Hassin R., Sviridenko M.: "Approximating the Maximum Quadratic Assignment Problem"; Information Processing Letters, 77, 1(2001), 13-16
10. Arora S., Frieze A., Kaplan H.: "A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems"; Mathematical Programming, 92, 1 (2002), 1-36.
11. Ball M.O., Kaku B. K., Vakhutinsky A.: "Network-based Formulations of the Quadratic Assignment Problem" ; European Journal of Operational Research, 104, 1(1998), 241-249
12. Battiti R., Tecchiolli G.: "Simulated Annealing and Tabu Search in the Long Run: A Comparison on QAP Tasks"; Computer and Mathematics with Applications, 28, 6(1994), 1-8
13. Bazaraa M. S., Sherali H. D.: "On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment problem"; Journal of the Operational Research Society, 33(1982), 991-1003
14. Boeringer D. W., Werner D. H.: "Particle Swarm Optimization Versus Genetic Algorithms for Phased Array Synthesis"; IEEE Transactions on Antennas and Propagation, 52, 3(2004), 771-779
15. Bos J.: "A Quadratic Assignment Problem Solved by Simulated Annealing"; Journal of Environmental Management, 37, 2(1993), 127-145
16. Boülte A., Thonemann U. W.: " Optimizing Simulated Annealing Schedules with Genetic Programming"; European Journal of Operational Research, 92, 2(1996), 402-416
17. Bozer Y. A., Suk-Chul R.: "A Branch and Bound Method for Solving the Bidirectional Circular Layout Problem"; Applied Mathematical Modeling, 20, 5(1996), 342-351
18. Brusco M. J., Stahl S.: " Using Quadratic Assignment Methods to Generate Initial Permutations for Least-Squares Unidimensional Scaling of Symmetric Proximity Matrices"; Journal of Classification, 17, 2(2000), 197-223
19. Burkard R. E., Rendl F.: "A Thermodynamically Motivated Simulation Procedure for Combinatorial Optimization Problems"; European Journal of Operational Research, 17, 2(1984), 169-174
20. Chakrapani J., Skorin-Kapov J.: "Massively Parallel Tabu Search for the Quadratic Assignment Problem"; Annals of Operations Research, 41, 1-4(1993), 327-342
21. Ciriani V., Pisanti N., Bernasconi A.: "Room Allocation: A polynomial Subcase of the Quadratic Assignment Problem" ; Discrete Applied Mathematics, 144, 3 (2004), 263-269
22. Cela, E.: "The Quadratic Assignment Problem: Theory and Algorithms"; "Combinatorial Optimization" (Du, D.Z. Pardalos, P. Eds.), Kluwer Academic Publishers, Dordrecht (1998).
23. Chakrapani J., Skorin-Kapov J.: "Massively Parallel Tabu Search for the Quadratic Assignment Problem"; Annals of Operations Research, 41, 1-4(1993), 327-342
24. Clausen J., Perregaard M.: "Solving Large Quadratic Assignment Problems in Parallel"; Computational Optimization and Applications, 8,(1997), 111-127
25. Clerc M., Kennedy J.: "The Particle Wwarm-explosion, Stability, and Convergence in A Multidimensional Complex Space" ; IEEE Transactions on Evolutionary Computation, 6, 1(2002), 58-73
26. Clerc M.: " Particle Swarm Optimization"; ISTE Publishing Company, London (2006).
27. Cristian T. I.: "The Particle Swarm Optimization Algorithm: Convergence Analysis and Parameter Selection"; Information Processing Letters, 85, 6 (2003), 317-325
28. Cung V. D., Mautor T., Michelon P., Tavares A.: "A Scatter Search Based Approach for the Quadratic Assignment Problem"; Proceedings of IEEE International Conference on Evolutionary Computation, (1997), 165-169
29. Dorigo M., Stützle, T.: "Ant Colony Optimization"; MIT Press, MA (2004).
30. Drezner Z.: "A New Genetic Algorithm for the Quadratic Assignment Problem"; Informs Journal on Computing, 15, 3(2003), 320-330
31. Drezner Z.: "The Extended Concentric Tabu for the Quadratic Assignment Problem"; European Journal of Operational Research, 160,(2005), 416-422
32. Drezner Z.: "Compounded Genetic Algorithms for the Quadratic Assignment Problem"; Operations Research Letters, 33, 5(2005), 475-480
33. Drezner Z., Hann P.M., Taillard E.D.: "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances That Are Difficult for Meta-heuristic Methods"; Annals of Operations Research, 139 (2005), 65-94
34. Eberhart R. C., Shi Y.: "Comparison Between Genetic Algorithms and Particle Swarm Optimization"; Proceedings of IEEE International Conference on Evolutionary Computation, (1998), 611-616
35. El-Baz M. A.: "A Genetic Algorithm for Facility Layout Problems of Different Manufacturing Environments" ; Computers and Industrial Engineering 47, 2-3(2004), 233-246
36. Erdoǧan G., Tansel B.: "A Branch-and-cut Algorithm for Quadratic Assignment Problems Based on Linearizations"; Computers and Operations Research, 34 (2007), 1085-1106
37. Fedjki C. A., Duffuaa S. O.: "An Extreme Point Algorithm for A Local Minimum Solution to the Quadratic Assignment Problem"; European Journal of Operational Research, 156, 3(2004), 566-578
38. Fleurent C., Glover, F.: " Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory"; INFORMS Journal on Computing, 11(1999), 189-203
39. Gambardella L. M., Taillard E. D., Dorigo, M.:" Ant Colonies for the Quadratic Assignment Problem" ; Journal of the Operational Research Society, 50, (1999), 167-176
40. Gilmore, P. C.: "Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem"; SIAM Journal on Applied Mathematics, 10 (1962), 305-313
41. Grosan C., Abraham A., Nicoara M.: "Search Optimization Using Hybrid Particle Sub-swarms and Evolutionary Algorithms"; International Journal of Simulation Systems, Science &. Technology, 6, 10-11(2005),60-79
42. Guo C., Tang H.: " Global Convergence Properties of Evolution Strategies"; Mathematica Numerica Sinica, 23, 1(2001), 105-110
43. Gutin G., Yeo A.: "Polynomial Approximation Algorithms for TSP and QAP with A Factorial Domination Number"; Discrete Applied Mathematics, 119, 1-2 (2002), 107-116
44. Loiola E. M., Maia de Abreu N. M., Boaventura-Netto P. O., Hahn P., Querido, T.: "A Survey for the Quadratic Assignment Problem"; European Journal of Operational Research, 176, (2007), 657-690
45. Hansen P., Mladenović, N.: " Variable Neighbourhood Search: Principles and Applications"; European Journal of Operations Research, 130, (2001), 449-467
46. Hansen P., Mladenović N.: "Variable Neighbourhood Search"; In: Glover, F.W. and Kochenberger G.A. (eds.), Handbook of Metaheuristics, Dordrecht, Kluwer Academic Publishers.
47. Hasegawa M., Ikeguchi T., Aihara, K., Itoh, K.: "A Novel Chaotic Search for Quadratic Assignment Problems"; European Journal of Operational Research, 139, (2002), 543-556
48. He R., Wang Y., Wang Q., Zhou J., Hu C,.: "An Improved Particle Dwarm Optimization Based on Self-adaptive Escape Velocity"; Journal of Software, 16, 12(2005), 2036-2044
49. Heffley D. R.: "Decomposition of the KoopmansCBeckmann Problem"; Regional Science and Urban Economics, 10, 4(1980), 571-580.
50. Jiang C. W. and Etorre B.: "A Hybrid Method of Chaotic Particle Swarm Optimization and Linear Interior for Reactive Power Optimisation"; Mathematics and Computers in Simulation, 68, (2005) 57-65
51. Jünger M., Kaibel V.: "Box-inequalities for Quadratic Assignment Polytopes"; Mathematical Programming, 91, 1(2001) 175-197
52. Kelly J. P., Laguna M., Glover F.: "A Study of Diversification Strategies for the Quadratic Assignment Problem"; Computers and Operations Research, 21, 8(1994) 885-893
53. Kennedy J., Eberhart R. C.: " A Discrete Binary Version of the Particle Swarm Algorithm" ; Proceedings of International Conference on Systems, Man, and Cybernetics, IEEE Computer Society Press, (1997), 4104-4108
54. Kennedy J., Eberhart R.: "Swarm Intelligence"; Morgan Kaufmann, CA (2001).
55. Kochhar J. S., Foster B. T., Heragu S. S.: "A Genetic Algorithm for the Unequal Area Facility Layout problem" ; Computers and Operations Research, 25, 7-8(1998), 583-594
56. Koopmans T. C., Beckman M. J.: " Assignment Problems and the Location of Economic Activities"; Econometrica, 25 (1957), 53-76
57. Lawler E. L.: "The Quadratic Assignment Problem"; Management Science, 9, (1963), 586-599
58. Liang J. J., Qin A. K., Suganthan P. N., Baskar S.: " Comprehensive Learning Particle Swarm Optimizer for Global Optimization of Multimodal Functions"; IEEE Transactions on Evolutionary Computation, 10, 3(2006), 281-295
59. Lim M., Yu Y., Omatu S.: "Extensive Testing of a Hybrid Genetic Algorithm for Solving Quadratic Assignment Problems" ; Computational Optimization and Applications, 23, (2002), 47-64
60. Liu H. Li B., Ji Y., Sun T.: "Particle Swarm Optimisation from Lbest to Gbest"; In: Abraham, A., Baets, B.D., Köppen, M., Nickolay, B. (Eds.), Applied Soft Computing Technologies: The Challenge of Complexity, Series: Advances in Soft Computing, Springer, (2006), 537-545
61. Liu H., Abraham A., Choi O., Moon S. H.: "Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-shop Scheduling Problems" ; Proceedings of The Sixth International Conference on Simulated Evolution and Learning, SEAL 2006, Lect. Notes in Comp. Sei, 4247(2006), 197-204
62. Liu H., Abraham A., Clerc M.: "Chaotic Dynamic Characteristics in Swarm Intelligence"; Applied Soft Computing Journal, Available online http://dx.doi.org/10.1016/j.asoc.2006.10.006.
63. Liu H., Abraham A., Zhang J.: "A Particle Swarm Approach to Quadratic Assignment Problems"; Proceedings of The Eleventh Online World Conference on Soft Computing in Industrial Applications (WSC11), Springer (in press).
64. Maniezzo V., Colorni A.: "The Ant System Applied to the Quadratic Assignment Problem"; IEEE Transactions on Knowlege and Data Engineering, 11, 5(1999), 769-778
65. Margarita R., Carlos A. C. C.: "Multi-objective Particle Swarm Optimizers: A Survey of the State-of-the-Art" ; International Journal of Computational Intelligence Research, 2, 3(2006), 287-308
66. Mautor T., Roucairol C.: "A New Exact Algorithm for the Solution of Quadratic Assignment Problems" ; Discrete Applied Mathematics, 55, (1994), 281-293
67. Merz P., Freisleben B.: "A Comparison of Mimetic Algorithms, Tabu Search, and Ant Colonies for the Quadratic Assignment Problem"; Proceedings of the 1999 International Congress of Evolutionary Computation, IEEE Press, (1999), 2063-2070
68. Merz P., Freisleben B.: "Fitness Landscape Analysis and Mimetic Algorithms for the Quadratic Assignment Problem"; IEEE Transactions on Evolutionary Computation, 4, 4 (2000), 337-352
69. Middendorf M., Reischle F., Schmeck H.: "Multi Colony Ant Algorithms"; Journal of Heuristics, 8, 3(2002), 305-320
70. Mills P., Tsang E., Ford J., : "Applying an Extended Guided Local Search to the Quadratic Assignment Problem" ; Annals of Operations Research, 118, 1-4(2003), 121-135.
71. Miranda G., Luna H. P. L., Mateus G. R., Ferreira R. P. M.: "A Performance Guarantee Heuristic for Electronic Components Placement Problems Including Thermal Effects"; Computers and Operations Research, 32, (2005), 2937-2957
72. Misevicius A.: "A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem"; Informatica, 14, 4 (2003), 497-514
73. Misevicius A.: "An Improved Hybrid Genetic Algorithm: New Results for the Quadratic Assignment Problem"; Knowledge-Based Systems, 17, (2004), 65-73
74. Misevicius A.: "A Tabu Search Algorithm for the Quadratic Assignment Problem"; Computational Optimization and Applications, 30, (2005), 95-111
75. Nissen V., Paul H.: "A Modification of Threshold Accepting and its Application to the Quadratic Assignment Problem"; Operation Research Spektrum, 17, 2-3 (1995), 205-210
76. Oliveira C. A. S., Pardalos M. P., Resende M. G. G.: "GRASP with Path Relinking for the Quadratic Assignment Problem"; Proceedings of Third International Workshop on Experimental and Efficient Algorithms, Lect. Notes Comp. Sci., 2266, (2004), 356-368
77. Ostrowski T., Ruoppila V. T.: "Genetic Annealing Search for Index Assignment in Vector Quantization"; Pattern Recognition Letters, 18, 4(1997), 311-318
78. Pang W., Wang K., Zhou C., Dong L.: "Fuzzy Discrete Particle Swarm Optimization for Solving Traveling Salesman Problem"; Proceedings of the Fourth International Conference on Computer and Information Technology, IEEE CS Press, 796-800
79. Parsopoulos K. E., Vrahatis M. N.: "Recent Approaches to Global Optimization Problems Through Particle Swarm Optimization" ; Natural Computing, 1, (2002), 235-306
80. Randall M.: " Near Parameter Free ant Colony Optimization"; Proceedings of Fourth International Workshop on Ant Colony Optimization and Swarm Intelligence, Lect. Notes Comp. Sei., 3172, (2004), 374-381
81. Roucairol C.: "A Parallel Branch and Bound Algorithm for the Quadratic Assignment Problem"; Discrete Applied Mathematics, 18, (1987), 211-225
82. Salman A., Ahmad I., Al-Madani S.: "Particle Swarm Optimization for Task Assignment Problem"; Microprocessors and Microsystems, 26, (2002), 363-371
83. Schute J. F., Groenwold A. A.: "A Study of Global Optimization Using Particle Swarms"; Journal of Global Optimization, 31, (2005), 93-108
84. Settles M., Rodebaugh B., Soule T.: "Comparison of Genetic Algorithm and Particle Swarm Optimizer When Evolving A Recurrent Neural Network" ; Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2003, Lect. Notes Comp. Sci., 2723, 148-149
85. Solimanpur M., Vrat P., Shankar R.: "Ant Colony Optimization Algorithm to the Inter-cell Layout Problem in Cellular Manufacturing"; European Journal of Operational Research, 157, 3 (2004), 592-606
86. Stützle T., Holger H.: "MAX-MIN Ant System"; Future Generation Computer Systems, 16, 8 (2000), 889-914
87. Stützle T.: "Iterated Local Search for the Quadratic Assignment Problem. European Journal of Operational Research, 174, (2006), 1519-1539
88. Talbi E. G., Rouxb O. Fonlupt, Robillard D.: " Parallel Ant Colonies for the Quadratic Assignment Problem" ; Future Generation Computer Systems, 17, (2001), 441-449
89. Tate D. E., Smith A. E.: "A Genetic Approach to the Quadratic Assignment Problem"; Computers and Operations Research, 22, (1995), 73-83
90. Tian P., Wang H. C., Zhang D. M.: "Simulated Snnealing for the Quadratic Assignment Problem: A Further Study" ; Computers and Industrial Engineering, 31, 3-4 (1996), 925-928
91. Taillard E.: "Robust Taboo Search for the Quadratic Assignment Problem"; Parallel Computing, 17, (1991), 443-455
92. Taillard E.: "Comparison of Iterative Searches for the Quadratic Assignment Problem"; Location Science, 3, 2 (1995), 87-105
93. Van den Bergh F., Engelbrecht A. P.: "A Study of Particle Swarm Optimization Particle Trajectories"; Information Sciences, 176, (2006), 937-971
94. Weisstein E. W.: "Borel-Cantelli Lemma"; From MathWorld - A Wolfram Web Resource, http://mathworld.wolfram.com/Borel-CantelliLemma.html.
95. Wiesemann W., Stützle T.: "Iterated Ants: An Experimental Study for the Quadratic Assignment Problem" ; Proceedings of the Fifth International Workshop on Ant Colony Optimization and Swarm Intelligence, ANTS 2006, Lect. Notes Comp. Sci., 4150, (2006), 179-190
96. Wikipedia: "NP-hard"; From Wikipedia - The Free Encyclopedia Web Resource, http://en.wikipedia.org/wiki/NP-hard.
97. Yip P. P. C., Pao Y.: "A Guided Evolutionary Simulated Annealing Approach to the Quadratic Assignment Problem"; IEEE Transaction on Systems, Man, and Cybernetics, 24, 9(1994), 1383-1387
98. Yu J., Sarker B. R.: "Directional Decomposition Heuristic for a. Linear Machine-cell Location Problem" ; European Journal of Operational Research, 149, 1 (2003), 142-184
99. Zhang C., Lin Z., Lin Z.: "Variable Neighborhood Search with Permutation Distance for QAP"; Preceedings of the Ninth International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2005, Lect. Notes Comp. Sci., 3684, 81-88