Article ID: | iaor2005724 |
Country: | United Kingdom |
Volume: | 31 |
Issue: | 9 |
Start Page Number: | 1491 |
End Page Number: | 1513 |
Publication Date: | Aug 2004 |
Journal: | Computers and Operations Research |
Authors: | Mart Rafael, El-Fallahi Abdellah |
Keywords: | heuristics |
Artificial neural networks (ANN) are inspired by the structure of biological neural networks and their ability to integrate knowledge and learning. In ANN training, the objective is to minimize the error over the training set. The most popular method for training these networks is back propagation, a gradient descent technique. Other non-linear optimization methods such as conjugate directions set or conjugate gradient have also been used for this purpose. Recently, metaheuristics such as simulated annealing, genetic algorithms or tabu search have also been adapted to this context. There are situations in which the necessary training data are being generated in real time and an extensive training is not possible. This “on-line” training arises in the context of optimizing a simulation. This paper presents extensive computational experiments to compare 12 “on-line” training methods over a collection of 45 functions from the literature within a short-term horizon. We propose a new method based on the tabu search methodology, which can compete in quality with the best previous approaches.