Performance analysis of the neighboring-ant search algorithm through design of experiment

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

Volumn 5572 LNAI, Issue , 2009, Pages 662-669

  Santillán, Claudia Gómez ^a,b   Reyes, Laura Cruz ^a   Conde, Eustorgio Meza ^b   Martinez, Claudia Amaro ^a   Lam, Marco Antonio Aguirre ^a   Zezzatti, Carlos Alberto Ochoa Ortíz ^c  

^a INSTITUTO POLITÉCNICO NACIONAL   (Mexico)

^b INSTITUTO TECNOLÓGICO DE CIUDAD MADERO   (Mexico)

^c UNIVERSIDAD AUTÓNOMA DE CIUDAD JUÁREZ   (Mexico)

Author keywords

Design of Experiment; Factorial Design; Metaheuristic Algorithm; Parameter Setting; Semantic Query Routing

Indexed keywords

ALGORITHM PERFORMANCE; ANT COLONY SYSTEMS; FACTORIAL DESIGN; LOCAL STRATEGIES; METAHEURISTIC; METAHEURISTIC ALGORITHM; NETWORK TOPOLOGY; PARAMETER SETTING; PERFORMANCE ANALYSIS; ROUTE QUERIES; SEARCH ALGORITHMS; SEMANTIC QUERY ROUTING;

ARTIFICIAL INTELLIGENCE; DESIGN OF EXPERIMENTS; ELECTRIC NETWORK TOPOLOGY; HEURISTIC METHODS; LEARNING ALGORITHMS; PACKET NETWORKS; ROUTING ALGORITHMS; SEMANTICS;

PROBABILITY DISTRIBUTIONS;

EID: 71049163842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02319-4_80     Document Type: Conference Paper

References (13)

1. Birattari, M., Stutzle, T.: A Racing algorithm for Configuring Metaheuristics. Artificial life, 11-18 (2002)
2. Barr, R., Golden, J., Kelly, M.: Designing and Reporting Computational Experiments with Heuristics Methods. Journal of Heuristics 1, 9-32 (1995)
3. Michalewicz, Z.: How to solve it: Modern Heuristics. Springer, NY (2000)
4. Angeline, P.: Adaptative and Self-Adaptative Evolutionary Computations. IEEE, Computational Intelligence, 152-163 (1995)
5. Montgomery, D.C.: Design and Analysis of Experiments. John Wiley & Sons, New York (2001)
6. Manson, R.L., Gunst, R.F., James, L.H.: Statistical Design and Analysis of Experiments with Applications to Engineering and Science, 2nd edn. Wiley - Interscience, Chichester (2003)
7. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
8. Michlmayr, E.: Ant Algorithms for Self-Organization in Social Networks. Doctoral Thesis, Women's Postgraduate College for Internet Technologies (WIT), Institute of Software Technology and Interactive Systems, Vienna University of Technology (2007)
9. Ortega, R., et al.: Impact of Dynamic Growing on the Internet Degree Distribution. Polish Journal of Environmental Studies 16, 117-120 (2007)
10. Cruz-Reyes, L., et al.: NAS Algorithm for Semantic Query Routing System for Complex Network. In: Advances in Soft Computing, vol. 50, pp. 284-292. Springer, Heidelberg (2008)
11. Barabási, A.L., Albert, R., Jeong, H.: Mean-Field theory for scale-free random networks. Physic A 272, 173-189 (1999)
12. Erdõs, P., Rényi, A.: On random graphs. I. Publ. Math. Debrecen 6, 290-297 (1959)
13. Adenso-Díaz, B., Laguna, M.: Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search. Operation Research, 99-114 (2004)