Article history: Received 21 January 2010 Accepted 27 October 2010 Available online 9 November 2010

An explicit exploration strategy is necessary in reinforcement learning (RL) to balance the need to reduce the uncertainty associated with the expected outcome of an action and the need to converge to a solution. This dependency is more acute in on-policy reinforcement learning where the exploration guides the search for an optimal solution. The need for a self-regulating exploration is manifes...

In the past several years, it has amply been demonstrated that metaheuristics, such as simulated annealing, tabu search, genetic algorithms and ant colony are simple, adaptable and computationally efficient to solve a large range of combinatorial problems including hard single objective industrial. In this paper, we propose a formalisation of the search process for finding compromise solutions ...

This thesis focuses on designing automatic planning tools for the planning problem of 3rd Generation (3G) Universal Mobile Telecommunication System (UMTS) all-IP Release 4 networks. A new mathematical model for the design problem of such architecture was proposed. The main advantage of the proposed model is to incorporate a realistic traffic profile taken from real live networks. Two approximat...

Three heuristic algorithms: simulated annealing, genetic algorithm, and Tabu search were compared to molecular docking procedure using 3 protein-ligand systems. Statistical analysis of the results indicated that the Tabu search showed the best performance in terms of locating solutions close to the crystallographic ligand conformation. From the comparisons, a hybrid search algorithm was propose...

Tabu Search with Strategic Oscillation for the Maximally Diverse Grouping Problem MICAEL GALLEGO Departamento de Ciencias de la Computación, Universidad Rey Juan Carlos, Spain. [email protected] MANUEL LAGUNA Leeds School of Business, University of Colorado at Boulder, USA [email protected] RAFAEL MARTÍ Departamento de Estadística e Investigación Operativa, Universidad de Valencia, S...

Two metaheuristic methods based on Tabu search are introduced to assign judges to individual competitions in a tournament. The complexity of the mathematical formulation accounting for the assignment rules, leads us to use such an approach. The first metaheuristic includes two different Tabu searches that are combined with a diversification strategy. The second metaheuristic is applied to a pen...