Abstract
In this work, we introduce a new parallel ant colony optimization algorithm based on an ant metaphor and the crossover operator from genetic algorithms.The performance of the proposed model is evaluated usingwell-known numerical test problems and then it is applied to train recurrent neural networks to identify linear and nonlinear dynamic plants. The simulation results are compared with results using other algorithms.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Reeves CR (Ed.) (1995) Modern Heuristic Techniques for Combinatorial Optimization. McGraw-Hill: UK.
Corne D, Dorigo M, Glover F (Eds) (1999) New Ideas in Optimization, McGraw-Hill: UK.
Farmer JD, Packard NH, Perelson AS (1986) The Immune System, Adaptation, and Machine Learning. Physica, 22D:187–204
Kalinli A, Karaboga D (2004) Training recurrent neural networks by using parallel tabu search algorithm based on crossover operation. Engineering Applications of Artificial Inteligence, 17(5):529–542
Dorigo M, Maniezzo V, Colorni A (1991) Positive feedback as a search strategy. Technical Report No:91–016 Politecnico di Milano
Dorigo M, Maniezzo V, Colorni A (1996) The ant system: Optimization by a colony of cooperating agents. IEEE Trans. on Systems, Man and Cybernetics – Part B, 26(1):1–13
Christopher FH et al. (2001) Swarm intelligence: an application of social insect optimization techniques to the traveling salesman problem. Artificial Intelligence I
Bullnheimer B, Hartl RF, and Strauss C (1999) A new rank based version of the ant system, a computational study. Central European J for Operations Research and Economics, 7(1):25–38
Stützle T, Hoos HH (1997) The MAX-MIN ant system and local search for the traveling salesman problem. In Baeck T, Michalewicz Z, Yao X, (Eds), Proc. of the IEEE Int. Conf. on Evolutionary Computation (ICEC’97):309–314
Gambardella LM, Dorigo M (1996) Solving symmetric and asymmetric TSPs by ant colonies. Proc. of IEEE Int. Conf. on Evolutionary Computation, IEEE-EC 96, Nagoya, Japan:622–627
Di Caro G, Dorigo M (1998) Mobile agents for adaptive routing. Proc. of 31st Hawaii Conf. on Systems Sciences (HICSS-31):74–83
Stützle T, Dorigo M (1999) ACO algorithms for quadratic assignment problem. in: Corne D, Dorigo M, Glover F (Eds), New Ideas in Optimization, McGraw-Hill:33–50
Gambardella LM, Taillard E, Agazzi G (1999) MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. Technical Report, IDSIA-06: Switzerland
Bilchev G, Parmee IC (1995) The ant colony metaphor for searching continuous design spaces. Lecture Notes in Computer Science, Springer-Verlag, LNCS 993:25–39
Monmarché N, Venturini G, Slimane M (2000) On how Pachycondyla apicalis ants suggest a new search algorithm. Future Generation Systems Computer 16(8):937–946
Dreo J, Siarry P (2004) Continuous ant colony algorithm based on dense heterarchy. Future Generation Computer Systems, 20(5):841–856
Hiroyasu T, Miki M, Ono Y, Minami Y (2000) Ant colony for continuous functions, The Science and Engineering, Doshisha University
Bullnheimer B, Kotsis G, Strauss C (1998) Parallelization strategies for the ant system. in: De Leone R, Murli A, Pardalos P, Toraldo G (Eds), High Performance Algorithms and Software in Nonlinear Optimization. Kluwer Series of Applied Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands, 24:87–100
Stützle T (1998) Parallelization strategies for ant colony optimization, in: Eiben AE, Back T, Schoenauer M, Schwefel HP (Eds), Fifth Int. Conf. on Parallel Problem Solving from Nature, Springer-Verlag: 1498:722–731
Middendorf M, Reischle F, Schmeck H (2000) Information exchange in multicolony algorithms. in: Rolim J, Chiola G, Conte G, Mansini LV, Ibarra OH., Nakano H. (Eds), Parallel and Distributed Processing: 15 IPDPSP Workshops Mexico, Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, Germany, 1800:645–652
Dorigo M (1993) Parallel ant system: An experimental study. Unpublished manuscript, (Downloadable from http://iridia.ulb.ac.be/∼mdorigo/ACO/ACO.html)
Talbi EG, Roux O, Fonlupt C, Robillard D (1999) Parallel ant colonies for combinatorial optimization problems. in: Rolim J. et al. (Eds) Parallel and Distributed Processing, 11 IPPS/SPDP’99 Workshops, Lecture Notes in Computer Science, Springer-Verlag, London, UK 1586:239–247
Bolondi M, Bondanza M (1993) Parallelizzazione di un algoritmo per la risoluzione del problema del commesso viaggiatore. Master’s Thesis, Dipartimento di Elettronica e Informazione, Politecnico di Milano: Italy
Michel R, Middendorf M (1998) An island model based ant system with lookahead for the shortest supersquence problem. in: Eiben AE, Back T, Schoenauer H, Schwefel P (Eds), Parallel Problem Solving from the Nature, Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, Germany, 1498:692–701
Delisle P, Krajecki M, Gravel M, Gagné C (2001) Parallel implementation of an ant colony optimization metaheuristic with openmp. Int. Conf. on Parallel Architectures and Compilation Techniques, Proceedings of the 3rd European Workshop on OpenMP (EWOMP’01), Barcelona, Spain
Krüger F, Merkle D, Middendorf M (1998) Studies on a parallel ant system for the BSP model, unpublished manuscript. (Downloadable from http://citeseer.ist.psu.edu/239263.html)
De Jong KA (1975) An Analysis of The Behaviour of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan
Pham DT, Liu X (1999) Neural Networks for Identification. Prediction and Control, 4th edn, Springer-Verlag
Arifovic J, Gencay R (2001) Using genetic algorithms to select architecture of a feedforward artificial neural network. Physica A, 289:574–594
Sexton RS, Gupta JND (2000) Comparative evaluation of genetic algorithm and backpropagation for training neural networks. Information Sciences, 129:45–59
Castillo PA, Merelo JJ, Prieto A, Rivas V, Romero G (2000) G-Prop: Global optimization of multilayer percetptrons using Gas. Neurocomputing, 35:149–163
Ku KW, Mak MW, Siu WC (1999) Adding learning to cellular genetic algorithms for training recurrent neural networks. IEEE Trans. on Neural Networks, 10(2):239-252
Blanco A, Delgado M, Pegalajar MC (2000) A genetic algorithm to obtain the optimal recurrent neural network. Int. J. Approximate Reasoning, 23:67–83
Blanco A, Delgado M, Pegalajar MC (2001) A real-coded genetic algorithm for training recurrent neural networks. Neural Networks, 14:93–105
Castillo PA, Gonzalez J, Merelo JJ, Prieto A, Rivas V, Romero G (1999) SA-Prop: Optimization of multilayer perceptron parameters using simulated annealing. Lecture Notes in Computer Science, Springer, 606:661-670
Sexton RS, Alidaee B, Dorsey RE, Johnson JD (1998) Global optimization for artificial neural networks: A tabu search application. European J of Operational Research, 106:570–584
Battiti R, Tecchiolli G (1995) Training neural nets with the reactive tabu search. IEEE Trans. on Neural Networks, 6(5):1185–1200
Zhang S-B, Liu Z-M (2001) Neural network training using ant algorithm in ATM traffic control. IEEE Int. Symp. on Circuits and Systems (ISCAS 2001) 2:157–160
Blum C, Socha K (2005) Training feed-forward neural networks with ant colony optimization: An application to pattern classification. Fifth Int. Conf. on Hybrid Intelligent Systems
Li J-B, Chung Y-K (2005) A novel back-propagation neural network training algorithm designed by an ant colony optimization. Transmission and Distribution Conference and Exhibition: Asia and Pacific:1–5
Elman JL (1990) Finding structure in time. Cognitive Science, 14:179–211
Liu X (1993) Modelling and Prediction Using Neural Networks. PhD Thesis, University of Wales College of Cardiff, Cardiff, UK.
Pham DT, Karaboga D (1999) Training Elman and Jordan networks for system identification using genetic algorithms. J. of Artificial Intelligence in Engineering 13:107–117
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kalinli, A., Sarikoc, F. (2007). A Parallel Ant Colony Optimization Algorithm Based on Crossover Operation. In: Siarry, P., Michalewicz, Z. (eds) Advances in Metaheuristics for Hard Optimization. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72960-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-72960-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72959-4
Online ISBN: 978-3-540-72960-0
eBook Packages: Computer ScienceComputer Science (R0)