Learnable tabu search guided by estimation of distribution for maximum diversity problems

Soft Computing

Volumn 16, Issue 4, 2012, Pages 711-728

  Wang, Jiahai ^a   Zhou, Ying ^a   Cai, Yiqiao ^a   Yin, Jian ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

Estimation of distribution; Guided mutation; Linkage learning; Maximum diversity problem; Tabu search

Indexed keywords

BENCH-MARK PROBLEMS; CONSTRUCTIVE METHODS; COOPERATIVE EVOLUTION; ESTIMATION OF DISTRIBUTION ALGORITHMS; ESTIMATION OF DISTRIBUTIONS; GUIDED MUTATION; IMPROVEMENT METHODS; KNOWLEDGE MODEL; LARGE SIZES; LINKAGE LEARNING; MAXIMUM DIVERSITY PROBLEMS; PROBABILISTIC MODELS; SEARCH PROCESS; SOLUTION SPACE; STARTING SOLUTIONS;

EVOLUTIONARY ALGORITHMS;

TABU SEARCH;

EID: 84857999744     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-011-0780-6     Document Type: Article

References (55)

1. Andrade PMD, Ochi LS, Martins SL (2005) GRASP with path relinking for the maximum diversity problem. In: Nikoletseas S (ed) Proceedings 4th International Workshop on Efficient Experimental Algorithms WEA, vol 3539. Springer, Berlin, pp 558-569.
2. Aringhieri R, Cordone R (2011) Comparing local search metaheuristics for the maximum diversity problem. J Oper Res Soc 62(2): 266-280.
3. Aringhieri R, Cordone R, Melzani Y (2008) Tabu search versus GRASP for the maximum diversity problem. 4OR Q J Oper Res 6(1): 45-60.
4. Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Carnegie Mellon Univ., Pittsburgh, PA Tech. Rep. CMU-CS-94-163.
5. Baluja S, Davies S (1997) Using optimal dependency-trees for combinatorial optimization: learning the structure of the search space. In: Proceedings of 1997 International Conference on Machine and Learning, pp 30-38.
6. Baluja S, Davies S (1998) Fast probabilistic modeling for combinatorial optimization. In: Proceedings of 15th National Conference Artificial Intelligence (AAAI-98), pp 469-476.
7. Beasley JE (2000) OR-Library: Unconstrained binary quadratic programming. http://people. brunel. ac. uk/~mastjjb/jeb/orlib/bqpinfo. htm.
8. de Bonet JS, Isbell CL Jr, Viola P (1994) MIMIC: finding optima by estimating probability densities. In: Mozer MC, Jordan MI, Petsche T (eds) Advances in neural information processing systems, vol 9. MIT Press, Cambridge, pp 424-430.
9. Brimberg J, Mladenović N, Urošević D, Ngai E (2009) Variable neighborhood search for the heaviest k-subgraph. Comput Oper Res 36(11): 2885-2891.
10. Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1): 3-18.
11. Duarte A, Martí R (2007) Tabu search and GRASP for the maximum diversity problem. Eur J Oper Res 178(1): 71-84.
12. Emmendorfer LR, Pozo ATR (2009) Effective linkage learning using low-order statistics and clustering. IEEE Trans Evol Comput 13(6): 1233-1246.
13. Gallego M, Duarte A, Laguna M, Martí R (2009) Hybrid heuristics for the maximum diversity problem. Comput Optim Appl 44(3): 411-426.
14. García S, Molina D, Lozano M, Herrera F (2009) A study on the use of nonparametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization. J Heurist 15(6): 617-644.
15. García S, Fernández A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inform Sci 180(10): 2044-2064.
16. Glover F, Lv Z, Hao J-K (2010) Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR Q J Oper Res 8(3): 239-253.
17. Guturu P, Dantu R (2008) An impatient evolutionary algorithm with probabilistic Tabu search for unified solution of some NP-Hard problems in graph and set theory via clique finding. IEEE Trans Syst Man Cybern Part B 38(3): 645-666.
18. Hao J-K (2011) Memetic algorithms for discrete optimization. In: Neri F, Cotta C, Moscato P (eds) Handbook of memetic algorithms. Springer, Berlin (in press).
19. Harik G (1999) Linkage learning via probabilistic modeling in the ECGA. Springer, Berlin.
20. Harik GR, Lobo FG, Goldberg DE (1999) The compact genetic algorithm. IEEE Trans Evol Comput 3(4): 287-297.
21. Hauschild M, Pelikan M, Sastry K, Lima C (2009) Analyzing probabilistic models in hierarchical BOA. IEEE Trans Evol Comput 13(6): 1199-1217.
22. James T, Rego C, Glover F (2009) Multistart tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans Syst Man Cybern Part A Syst Hum 39(3): 579-596.
23. Katayama K, Narihisa H (2004) An evolutionary approach for the maximum diversity problem. In: Hart W, Krasnogor N, Smith JE (eds) Recent advances in memetic algorithms. Spinger, Berlin, pp 31-47.
24. Kochenberger G, Glover F, Alidaee B, Rego C (2004) A unified modeling and solution framework for combinatorial optimization problems. OR Spectr 26(2): 1-14.
25. Kuo CC, Glover F, Dhir KS (1993) Analyzing and modeling the maximum diversity problem by zero-one programming. Decis Sci 24: 1171-1185.
26. Lozano M, Garca-Martnez C (2010) Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report. Comput Oper Res 37(3): 481-497.
27. Lozano JA, Zhang Q, Larrañaga P (2009) Guest Editorial: Special issue on evolutionary algorithms based on probabilistic model. IEEE Trans Evol Comput 13(6): 1197-1198.
28. Lozano M, Molina D, García-Martínez C (2011) Iterated greedy for the maximum diversity problem. Eur J Oper Res 214(1): 31-38.
29. Lv Z, Hao J-K (2010) A memetic algorithm for graph colorin. Eur J Oper Res 203(1): 241-250.
30. Lv Z, Glover F, Hao J-K (2010) A hybrid metaheuristic approach to solving the UBQP problem. Eur J Oper Res 207(3): 1254-1262.
31. Martí R, Moreno-Vega JM, Duarte A (2011) Advanced multi-start methods. In: Gendreau M, Potvin J-Y (eds) Handbook of Metaheuristics, International series in operations research & management Science, vol 146, pp 265-281.
32. Martí R, Gallego M, Duarte A (2011) Heuristics and metaheuristics for the maximum diversity problem. J Heurist (in press). doi: 10. 1007/s10732-011-9172-4.
33. Martí L, García J, Berlanga A, Molina JM (2009) On the model-building issue of multi-objective estimation of distribution algorithms. In: Corchado E et al (eds) Proceeding of the 4th international conference on hybrid artificial intelligence system, LNAI, vol. 5572. Springer, Berlin, pp 293-300.
34. Martí R, Gallego M, Duarte A (2010) A branch and bound algorithm for the maximum diversity problem. Eur J Oper Res 200(1): 36-44.
35. Misevicius A, Lenkevicius A, Rubliauskas D (2006) Iterated tabu search: an improvement to standard tabu search. Inform Technol Control 35(3): 187-197.
36. Mühlenbein H, Paass G (1996) From recombination of genes to the estimation of distributions I. binary parameters. In: Proceedings of International Conference on Evolution and Computers, PPSN IV, pp 178-187.
37. Mühlenbein H, Mahnig T, Rodriguez A (1999) Schemata, distributions and graphical models in evolutionary optimization. J Heurist 5: 215-247.
38. Palubeckis G (2004) Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann Oper Res 131(1-4): 259-282.
39. Palubeckis G (2006) Iterated tabu search strategies for the unconstrained binary quadratic optimization problem. Informatica 17(2): 279-296.
40. Palubeckis G (2007) Iterated tabu search for the maximum diversity problem. Appl Math Comput 189(1): 371-383.
41. Peña J, Lozano J, Larrañaga P (2005) Globally multimodal problem optimization via an estimation of distribution algorithm based on unsupervised learning of Bayesian networks. Evol Comput 13(1): 43-66.
42. Pelikan M, Mühlenbein H (1999) The bivariate marginal distribution algorithm. In: Roy R, Furuhashi T, Chawdhry PK (eds) Advances in soft computing-engineering design and manufacturing. Springer, London pp 521-535.
43. Pelikan M, Goldberg DE, Cantú-paz EE (2000) Linkage problem, distribution estimation, and Bayesian networks. Evol Comput 8(3): 311-340.
44. Platel MD, Schliebs S, Kasabov N (2009) Quantum-inspired evolutionary algorithm: a multimodel EDA. IEEE Trans Evol Comput 13(6): 1218-1232.
45. Santana R, Larrañaga P, Lozano JA (2009) Research topics in discrete estimation of distribution algorithms based on factorizations. Memet Comput 1(1): 35-54.
46. Silva GC, de Andrade MRQ, Ochi LS, Martins SL, Plastino A (2007) New heuristics for the maximum diversity problem. J Heurist 13(4): 315-336.
47. Wang L, Fang C (2010) An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem. Comput Oper Res 39(2): 449-460.
48. Wang L, Fang C (2011) An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem. Inform Sci 181(20): 4804-4822.
49. Wang J, Zhou Y, Yin J, Zhang Y (2009) Competitive Hopfield network combined with estimation of distribution for maximum diversity problems. IEEE Trans Syst Man Cybern Part B Cybern 39(4): 1048-1066.
50. Wang J, Kuang Z, Xu X, Zhou Y (2009) Discrete particle swarm optimization based on estimation of distribution for polygonal approximation problems. Expert Syst Appl 36(5): 9398-9408.
51. Xin B, Chen J, Zhang J, Fang H, Peng Z-H (2011) Hybridizing differential evolution and particle swarm optimization to design powerful optimizers: a review and taxonomy. IEEE Trans Systems Man Cybern Part C Appl Rev (in press).
52. Zhang Q, Sun J (2006) Iterated local search with guided mutation. In: Proceedings of IEEE Congress on Evolutionary Computation, pp 924-929.
53. Zhang Q, Sun J, Tsang E (2005) Evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans Evol Comput 9(2): 192-200.
54. Zhang Q, Sun J, Xiao G, Tsang E (2007) Evolutionary algorithms refining a heuristic: a hybrid method for shared-path protections in WDM networks under SRLG constraints. IEEE Trans Syst Man Cybern Part B 37(1): 51-61.
55. Zhang Q, Sun J, Tsang E (2007) Combinations of estimation of distribution algorithms and other techniques. Int J Autom Comput 4(3): 273-280.