A subset-based ant colony optimisation with tournament path selection for high-dimensional problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8790, Issue , 2014, Pages 232-247

  Sapin, Emmanuel ^a   Keedwell, Ed ^a  

^a UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

High dimensional NP hard problems; Knapsack problem; Roulette wheel selection; Subset based ant colony optimization; Tournament selection

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BIG DATA; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; WHEELS;

ANT COLONY OPTIMISATION; GENOME-WIDE ASSOCIATION STUDIES; HIGH-DIMENSIONAL; HIGH-DIMENSIONAL PROBLEMS; KNAPSACK PROBLEMS; PATH SELECTION; ROULETTE WHEEL SELECTION; TOURNAMENT SELECTION;

ANT COLONY OPTIMIZATION;

EID: 84912059800     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-44994-3_12     Document Type: Article

References (15)

1. Blum, C.: ACO applied to group shop scheduling: a case study on intensification and diversification. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 14-27. Springer, Heidelberg (2002)
2. Christmas, J., Keedwell, E., Frayling, T., Perry, J.: Ant colony optimisation to identify genetic variant association with type 2 diabetes. Inf. Sci. 181, 1609-1622 (2011)
3. Dantzig, T.: Numbers: The Language of Science. Macmillan, New York (1930)
4. Dorigo, M., Caro, G.D.: New Ideas in Optimization, pp. 11-32. McGraw-Hill Ltd., Maidenhead (1999)
5. Dorigo, M., Maniezzo, V., Colorni, A.: Positive Feedback as a Search Strategy (1991)
6. Greene, C.S., White, B.C., Moore, J.H.: Ant colony optimization for genome-wide genetic analysis. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stutzle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 37-47. Springer, Heidelberg (2008)
7. Leguizamon, G., Michalewicz, Z.: A new version of ant system for subset problems. In: Angeline, P.J., Michalewicz, Z., Schoenauer, M., Yao, X., Zalzala, A. (eds.) Proceedings of the Congress on Evolutionary Computation, Mayflower Hotel, Washington, vol. 2, pp. 1459-1464. IEEE Press (1999)
8. Mathews, G.B.: On the partition of numbers. Proc. London Math. Soc. 28, 486-490 (1897)
9. Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resourceconstrained project scheduling. IEEE Trans. Evol. Comput. 6, 893-900 (2000)
10. Mohamad, M.M.: Articulated robots motion planning using foraging ant strategy. J. Inf. Technol. 20, 163-181 (2008).
11. Special Issues in Artificial Intelligence Moore, J.H.: A global view of epistasis. Nat. Genet. 37, 13-14 (2005). (Nature Publishing Group)
12. Sapin, E., Keedwell, E.: T-aco-tournament ant colony optimisation for high dimensional problems, pp. 81-86, SciTePress (2012)
13. Sapin, E., Keedwell, E., Frayling, T.: Ant colony optimisation for exploring logical gene-gene associations in genome wide association studies (2013a)
14. Sapin, E., Keedwell, E., Frayling, T.: Subset-based ant colony optimisation for the discovery of gene-gene interactions in genome wide association studies (2013b)
15. Zecchin, A., Maier, H., Simpson, A., Leonard, M., Nixon, J.: Ant colony optimization applied to water distribution system design: comparative study of five algorithms. J. Water Resour. Plan. Manage. 133, 87-92 (2007)