Meta-heuristic combining prior online and offline information for the quadratic assignment problem

IEEE Transactions on Cybernetics

Volumn 44, Issue 3, 2014, Pages 429-444

  Sun, Jianyong ^a   Zhang, Qingfu ^b,c   Yao, Xin ^d  

^a UNIVERSITY OF ABERTAY DUNDEE   (United Kingdom)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF ESSEX   (United Kingdom)

^d UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Fitness landscape analysis; meta heuristics; offline global information; online local information; quadratic assignment problem

Indexed keywords

COMBINATORIAL OPTIMIZATION;

FITNESS LANDSCAPE ANALYSIS; GLOBAL INFORMATIONS; LOCAL INFORMATION; META HEURISTICS; QUADRATIC ASSIGNMENT PROBLEMS;

HEURISTIC ALGORITHMS;

EID: 84896862573     PISSN: 21682267     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCYB.2013.2256892     Document Type: Article

References (64)

1. R. K. Ahuja, J. B. Orlin, and A. Tiwari, "A greedy genetic algorithm for the quadratic assignment problem," Comput. Oper. Res., vol. 27, no. 10, pp. 917-934, Sep. 2000. (Pubitemid 30334510)
2. J. C. Bezdek, R. J. Hathaway, R. E. Howard, C. A. Wilson, and M. P. Windham, "Local convergence analysis of a grouped variable version of coordinate descent," J. Optimization Theory Appl., vol. 54, no. 3, pp. 471-477, 1987. (Pubitemid 17652121)
3. J. L. Bresina, "Heuristic-biased stochastic sampling," in Proc. 13th Nat. Conf. Artif. Intell., Portland, OR, USA, 1996, pp. 271-278.
4. R. E. Burkard, S. Karisch, and F. Rendl, "QAPLIB: A quadratic assignment problem library," Eur. J. Oper. Res., vol. 55, no. 4, pp. 391-403, Jun. 1997. (Pubitemid 127502198)
5. M. Dorigo, M. Birattari, and T. Stützle, "Ant colony optimization," IRIDIA, Tech. Rep. TR/IRIDIA/2006-023, 2006.
6. M. Dorigo, V. Maniezzo, and A. Colorni, "Positive feedback as a search strategy," Dipartimento Elettronica, Politecnico Milano, Milan, Italy, Tech. Rep. 91-016, 1991.
7. M. Dorigo, V. Maniezzo, and A. Colorni, "The ant system: Optimization by a colony of cooperating agents," IEEE Trans. Syst., Man, Cybern., B Cybern., vol. 26, no. 1, pp. 29-41, Feb. 1996. (Pubitemid 126780573)
8. M. Dorigo and T. Stützle, "The ant colony optimization metaheuristic: Algorithms, applications, and advances," in International Series in Operations Research and Management Science. Boston, MA, USA: Kluwer Academic, 2003, pp. 251-285.
9. M. Dorigo and T. Stützle, Ant Colony Optimization. Cambridge, MA, USA: MIT Press, 2004.
10. Z. Drezner, "Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem," Comput. Oper. Res., vol. 35, no. 3, pp. 717-736, Mar. 2008. (Pubitemid 47368850)
11. T. A. Feo, K. Sarathy, and J. McGahan, "A greedy randomized adaptive search procedure for maximum independent set," Oper. Res., vol. 42, no. 5, pp. 860-878, Sep.-Oct. 1994.
12. T. A. Feo, K. Venkatraman, and J. Bard, "A GRASP for a difficult single machine scheduling problem," Comput. Oper. Res., vol. 18, no. 8, pp. 635-643, 1991.
13. N. Fescioglu-Unver and M. M. Kokar, "Self controlling tabu search algorithm for the quadratic assignment problem," Comput. Ind. Eng., vol. 60, no. 2, pp. 310-319, Mar. 2011.
14. C. Fleurent and F. Glover, "Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory," INFORMS J. Comput., vol. 11, no. 2, pp. 198-204, Feb. 1999.
15. L. Gambardella, É. Taillard, and M. Dorigo, "Ant colonies for the QAP," J. Oper. Res. Soc., vol. 50, no. 2, pp. 167-176, Feb. 1999.
16. H. Gao and W. Xu, "A new particle swarm algorithm and its globally convergent modifications," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 41, no. 5, pp. 1334-1351, Oct. 2011.
17. F. Glover and M. Laguna, Tabu Search. Boston, MA, USA: Kluwer Academic, 1998.
18. F. W. Glover and G. A. Kochenberger, Eds. Handbook of Metaheuristics. Boston, MA, USA: Kluwer Academic, Oct. 2003.
19. D. E. Goldberg, K. Deb, H. Kargupta, and G. Harik, "Rapid, accurate optimization of difficult problems using fast messy genetic algorithms," in Proc. 5th Int. Conf. Genetic Algor., 1993, pp. 56-64.
20. P. Hansen and N. Mladenović, "Developments of variable neighborhood search," in Essays and Surveys in Metaheuristics, G. C. Ribeiro and P. Hansen, Eds. Boston, MA, USA: Kluwer Academic, 2002, pp. 415-439.
21. J. He, X. Yao, and J. Li, "A comparative study of three evolutionary algorithms incorporating different amount of domain knowledge for node covering problems," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 35, no. 2, pp. 266-271, May 2005. (Pubitemid 40654440)
22. X. Huang, Y. Tan, and X. He, "An intelligent multifeature statistical approach for the discrimination of driving conditions of a hybrid electric vehicle," IEEE Trans. Intell. Transport. Syst., vol. 12, no. 2, pp. 453-465, Jun. 2011.
23. S. Iordache, "Consultant-guided search algorithms for the quadratic assignment problem," Lecture Notes Comput. Sci., vol. 6373, pp. 148-159, 2010.
24. 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, vol. 39, no. 3, pp. 579-596, 2009.
25. Y. Jin, Ed., Knowledge Incorporation in Evolutionary Computation. Heidelberg, Germany: Springer, 2005.
26. J. Kennedy and R. Eberhart, "Particle swarm optimization," in Proc. IEEE Int. Conf. Neural Netw., vol. 4. 1995, pp. 1942-1948.
27. M. Laguna and J. L. González-Velarde, "A search heuristic for just-intime scheduling in parallel machines," J. Intell. Manufact., vol. 2, no. 4, pp. 253-260, Aug. 1991.
28. M. Laguna and R. Marti, "GRASP and path relinking for 2-layer straight line crossing minimization," INFORMS J. Comput., vol. 11, no. 1, pp. 44-52, Jan. 1999.
29. P. Larrañaga and J. A. Lozano, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Boston, MA, USA: Kluwer Academic, 2002.
30. J. Li, G. Lu, and X. Yao, "Fitness landscape-based parameter tuning method for evolutionary algorithms for computing unique input output sequences," in Proc. 18th ICONIP, LNCS 7063. Nov. 2011, pp. 453-460.
31. Y. Li, R. Pardalos, and M. Resende, "A greedy randomized adaptive search procedure for the quadratic assignment problem," in DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Providence, RI, USA: American Mathematical Society 1994, pp. 237-261.
32. K.-H. Liang, X. Yao, and C. Newton, "Evolutionary search of approximated n-dimensional landscapes," Int. J. Knowledge-Based Intell. Eng. Syst., vol. 4, no. 3, pp. 172-183, Jul. 2000.
33. F. J. Lobo, C. F. Lima, and Z. Michalewicz, Eds., Parameter Setting in Evolutionary Algorithms (Studies in Computational Intelligence, vol. 54). Berlin, Germany: Springer, 2007.
34. G. Lu, J. Li, and X. Yao, " Fitness-probability cloud and a measure of problem hardness for evolutionary algorithms," in Proc. 11th Eur. Conf. EvoCOP, vol. 6622. Apr. 2011, pp. 108-117.
35. Q. Lu and X. Yao, "Clustering and learning Gaussian distribution for continuous optimization," IEEE Trans., Syst., Man, Cybern. C, Appl. Rev., vol. 35, no. 2, pp. 195-204, May 2005. (Pubitemid 40654432)
36. V. Maniezzo and A. Colorni, "The ant system applied to the quadratic assignment problem," IEEE Trans. Knowl. Data Eng., vol. 11, no. 5, pp. 769-778, Sep.-Oct.1999. (Pubitemid 30518732)
37. V. Maniezzo, A. Colorni, and M. Dorigo, "The ant system applied to the quadratic assignment problem," IRIDIA, Univ. Bruxelles, Tech. Rep. 94/28, 1994.
38. S. L. Martins, M. G. C. Resende, C. C. Ribeiro, and P. Pardalos, "A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy," J. Global Optimiz., vol. 17, no. 1-4, pp. 267-283, Sep. 2000.
39. Y. Mei, K. Tang, and X. Yao, "A memetic algorithm for periodic capacitated arc routing problem," IEEE Trans. Syst., Man, Cybern. B, vol. 41, no. 6, pp. 1654-1667, Dec. 2011.
40. D. P. Merz, "Memetic algorithms for combinatorial optimization problems: Fitness landscapes and effective search strategies," Ph.D. thesis, Dept. Electr. Eng. Comput. Sci., Univ. Siegen, Siegen, Germany, 2000.
41. D. P. Merz, "Advanced fitness landscape analysis and the performance of memetic algorithms," Evol. Comput., Special Issue Memetic Evol. Algor., vol. 12, no. 3, pp. 303-326, 2004.
42. D. P. Merz and B. Freisleben, "Fitness landscape, memetic algorithms and greedy operators for graph bi-partitioning," Evol. Comput., vol. 8, no. 1, pp. 61-91, 2000.
43. H. Mühlenbein, "The equation for response to selection and its use for prediction," Evol. Comput., vol. 5, no. 3, pp. 303-346, 1998.
44. H. Mühlenbein and T. Mahnig, "Convergence theory and applications of the factorized distribution algorithm," J. Comput. Informat. Technol., vol. 7, no. 1, pp. 19-32, 1999.
45. H. Mühlenbein and T. Mahnig, "Evolutionary algorithms: From recombination to search distributions," Theoretical Aspects of Evol. Comput. Natural Comput., pp. 137-176, 2000.
46. C. A. S. Oliveira, P. M. Pardalos, and M. G. C. Resende, "Grasp with path-relinking for the quadratic assignment problem," AT&T Labs., Tech. Rep., 2004.
47. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz, "Linkage problem, distribution estimation and Bayesian networks," Evol. Comput., vol. 8, no. 3, pp. 311-340, 2000.
48. F. Peng, K. Tang, G. Chen, and X. Yao, "Population-based algorithm portfolios for numerical optimization," IEEE Trans. Evol. Comput., vol. 14, no. 5, pp. 782-800, Oct. 2010.
49. M. Prais and C. G. Ribeiro, "Reactive grasp: An application to a matrix decomposition problem in TDMA traffic assignment," INFORMS J. Comput., vol. 12, no. 3, pp. 164-176, Jul. 2000.
50. R.-E. Precup, R.-C. David, E. M. Petriu, M.-B. Radac, S. Preitl, and J. Fodor, "Evolutionary optimization-based tuning of low-cost fuzzy controllers for servo systems," Knowledge-Based Syst., vol. 38, pp. 74-84, Jan. 2011.
51. M. Resende and C. C. Ribeiro, "Greedy randomized adaptive search procedures," in State-of-the-Art Handbooks in Meta-Heuristics. Boston, MA, USA: Kluwer Academic, 2003.
52. C. C. Ribeiro and M. C. Souza, "Variable neighborhood search for the degree constrained minimum spanning tree problem," Discrete Appl. Math., vol. 118, nos. 1-2, pp. 43-54, Apr. 2002.
53. R. Rubinstein, "The cross-entropy method for combinatorial optimization and continuous optimization," Method. Comput. Appl. Probability, vol. 1, no. 2, pp. 127-190, 1999.
54. S. J. Shyu, P. Y. Yin, B. M. T. Lin, and T. S. Hsiao, "An ant colony optimization algorithm for the minimum weight vertex cover problem," Ann. Oper. Res., vol. 131, nos. 1-4, pp. 283-304, Oct. 2004. (Pubitemid 39187384)
55. T. Stützle, "Iterated local search for the quadratic assignment problem," Intellectics Group, Computer Science Dept., Darmstadt Univ. Technol., Tech. Rep. AIDA-99-03, 1999.
56. T. Stützle and H. Hoos, "MAX-MIN ant system and local search for combinatorial optimization problem," in Meta-Heuristic: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I. H. Osman, and C. ROucairol, Eds. Boston, MA, USA: Kluwer Academic, 1999, pp. 313-329.
57. T. Stützle and H. Hoos, "MAX-MIN ant system," Future Generation Comput. Syst., vol. 16, no. 8, pp. 889-914, 2000.
58. É.D. Taillard, "Robust taboo search for the quadratic assignment problem," Parallel Comput., vol. 17, Nos. 4-5, pp. 443-455, Jul. 1991.
59. É.D. Taillard, "Comparison of iterative searches for the quadratic assignment problem," Location Sci., vol. 3, No. 2, pp. 87-105, Aug. 1995.
60. É. D. Taillard, "FANT: Fast ant system," DSIA, Lugano, Switzerland, Tech. Rep. IDSIA 46-98, 1998.
61. X. Yao, "Dynamic neighborhood size in simulated annealing," in Proc. Int. Joint Conf. Neural Networks, vol. 1. 1992, pp. 411-416.
62. Q. Zhang, J. Sun, and E. P. K. Tsang, "Evolutionary algorithm with the guided mutation for the maximum clique problem," IEEE Trans. Evol. Comput., vol. 9, no. 2, pp. 192-200, Apr. 2005. (Pubitemid 40564736)
63. Q. Zhang, J. Sun, E. P. K. Tsang, and J. A. Ford, "Combination of guided local search and estimation of distribution algorithm for solving quadratic assignment problem," in Proc. Bird Feather Workshops Genetic Evol. Comput. Conf., 2004, pp. 42-48.
64. Q. Zhang, J. Sun, G. Xiao, and E. P. K. Tsang. "Evolutionary algorithms refining a heuristic: Hyper-heuristic for shared-path protections in wdm networks under srlg constraints," IEEE Trans. Syst., Man, Cybern. B, vol. 37, no. 1, pp. 51-61, Feb. 2007. (Pubitemid 46358479)