Performance of aggregation pheromone system on unimodal and multimodal problems

2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

Volumn 1, Issue , 2005, Pages 880-887

  Tsutsui, Shigeyoshi ^a   Pelikan, Martin ^b   Ghosh, Ashish ^c  

^a HANNAN UNIVERSITY   (Japan)

^b UNIVERSITY OF MISSOURI ST LOUIS   (United States)

^c INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATION PHEROMONE SYSTEMS (APS); ANT COLONY OPTIMIZATION (ACO); MULTIMODAL PROBLEMS; PARAMETER SETTINGS;

MATHEMATICAL MODELS; MODAL ANALYSIS; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

EVOLUTIONARY ALGORITHMS;

EID: 27144463940     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Bullnheimer, B., Hartl, R. F., and Strauss, C.: A New Rank Based Version of the Ant System: A Computational Study, Central European Journal for Operations Research and Economics, 7(1):25-38, 1999.
2. Dorigo M., Maniezzo, V., and Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents, IEEE Trans. on SMC-Part B, 26(1):29-41, 1996.
3. Dorigo M. & L.M. Gambardella : Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE TEC, 1 (1):53-66, 1997.
4. Stützle, T. and H. Hoos, H.: The MAX-MIN Ant System and local Search for Combinatorial Optimization Problems: Towards Adaptive Tools for Global Optimization, Proc. of the 2nd Metaheuristics Int. Conf. (MC-97), 1997.
5. Maniezzo, V.: Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem, CSR 98-1, Scienze dell'Informazione, Universitá di Bologna, 1998.
6. Costa, D. and Hertz, A.: Ants Can Colour Graphs. Journal of the Operational Research Society, 48:295-305, 1997.
7. Forsyth P. and Wren, A.: An Ant System for Bus Driver Scheduling. Proc. of the 7th Int. Workshop on Computer-Aided Scheduling of Public Transport, 1997.
8. Bullnheimer, B., Hartl, R. F., and Strauss, C.: Applying the Ant System to the Vehicle Routing Problem, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Voss, S., et al (Eds.), Kluwer, 1999.
9. Schoonderwoerd, R., Holland, O., Bruten, J., and L. Rothkrantz, L.: Ant-based Load Balancing in Telecommunications Networks. Adaptive Behavior, 5(2): 169-207, 1997.
10. Tsutsui, S. and Ghosh, A.: An Extension of Ant Colony Optimization for Function Optimization Proceedings of the 5th Asia-Pacific Conference on Simulated Evolution And Learning (SEAL04), Pusan, Korea, 2004.
11. Tsutsui, S.: Ant Colony Optimisation for Continuous Domains with Aggregation Pheromones Metaphor: Proceedings of the The 5th International Conference on Recent Advances in Soft Computing (RASC-04), pp. 207-212, 2004.
12. Lorenzo Figueiras, A.N. and Lazzari, C. R.: Aggregation behavior and interspecific responses in three species of Triatomine, Memórias do Instituto Oswaldo Cruz. 93(1):133-137, 1998.
13. Bell, W. J.: Chemo-orientation in Walking Insects, Chemical Ecology of Insects, Bell, W. J. and Carde, R. T. Eds, 93-109, 1984.
14. Sakuma, M. and Fukami, H.: Aggregation arrestant pheromone of the German cockroach, Blattella germanica (L.) (Dictyoptera: Blattellidae): isolation and structure elucidation of blasttellastanoside-A and -B, Journal of Chem. Ecol. 19:2521-2541, 1993.
15. Schatzman, M., Taylor, J., and Schatzman, M.: Numerical Analysis: A Mathematical Introduction, Oxford Univ Press, 2002.
16. Higuchi, T., Tsutsui, S., and Yamamura, M.: Theoretical analysis of simplex crossover for real-coded Genetic Algorithms, Proc. of the PPSN VI, 365-374, 2000.
17. Ono, I. and Kobayashi, S.: A Real-Coded Genetic Algorithm for Function Optimization Using the Unimodal Normal Distribution Crossover, Proc. of the 7th ICGA, 246-253, 1997.
18. Hansen, N. and A. Ostermeier. Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pp. 312-317, 1996.
19. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T. A Fast Elitist Non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Proceedings of the Parallel Problem Solving from Nature VI Conference, 16-20 September. (Paris, France), pp. 849-858, 2000.
20. Ahn, C.W., Ramakrishna, R.S., and Goldberg, D.E. Real-coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the continuous World. Proc. of the Genetic and Evolutionary Computation Conference 2004 (GECCO-2004), 840-851, 2004.
21. Ocenasek, J., Schwarz, J.: Estimation of Distribution Algorithm for mixed continuous-discrete optimization problems. Proc. of the 2nd Euro-International Symposium on Computational Intelligence, IOS Press, Kosice, Slovakia, 227-232, 2002.
22. Schwefel, H. P.: Adaptive Mechanismen in der biologischen Evolution und ihr Einfluss auf die Evolutionsgeschwindigkeit, Technical Report Re 215/3, 1974.
23. Rechenberg, I: Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Frommann-Holzboog, 1973.
24. Larranaga, P. and Lozano, J. A. editors: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston, MA, 2002.
25. Pelikan, M., Goldberg, D. E., and Lobo, F.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5-20, 2002.
26. Bilchev, G. and Parmee,I. C.: The Ant Colony Metaphor for Searching Continuous Design Spaces. Proc. of the AISB Workshop on Evolutionary Computation, T. Fogarty (Eds.), Lecture Notes in Computer Science. 993, Springer Verlag, 24-39, 1995.
27. Mathur, M. and Karle, S.B. and Priye, S., Jyaraman, V.K. and Kulkarni, B. D.: Ant Colony Approach to Continuous Function Optimization. Ind. Eng. Chem. Res, 39:3814-3822, 2000.
28. Wodrich, M. and Bilchev G.: Cooperative distribution search: the ant't way, Control Cybernetics, 3:413-446, 1997.
29. Monmarch'e, N. and Venturini, G. and Slimane, M.: On how Pachycondyla apicalis ants suggest a new search algorithm, Future Generation Computer Systems, 16(8):937-946, 2000.
30. Dr'eo, J. and Siarry, P.: A New Ant Colony Algorithm Using the Heterarchical Concept aimed at optimization of multiminima continuous functions, Proc. of the Third International Workshop on Ant Algorithms (ANTS 2002), Dorigo, M. and Di Caro, G. and Sampels, M. (Eds.). Lecture Notes in Computer Science 2463 Springer Verlag, 216-221, 2002.
31. Seid H. Pourtakdoust and Hadi Nobahari (2004). An Extension of Ant Colony System to Continuous Optimization Problems. Proc. of Fourth International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS 2004), Dorigo, M. and Birattari, M. and Blum, C. and Gambardella, L.M. and Mondada, F. and Stuetzle, T. (Eds.). Lecture Notes in Computer Science 3172 Springer Verlag. 294-301, 2004.
32. Socha, K.: ACO for Continuous and Mixed-Variable Optimization, Proc. of Fourth International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS 2004), Dorigo, M. and Birattari, M. and Blum, C. and Gambardella, L.M. and Mondada, F. and Stuetzle, T. (Eds.). Lecture Notes in Computer Science 3172 Springer Verlag, 25-36, 2004.
33. Eshelman, L. J.: The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination, Foundations of Genetic Algorithms, Morgan Kaufmann, 265-283, 1991.