𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm

✍ Scribed by Yi-Feng Hung; Wei-Chih Chen

Publisher
Springer US
Year
2010
Tongue
English
Weight
257 KB
Volume
51
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Branch and bound methods for a search pr
Branch and bound methods for a search problem
✍ Alan R. Washburn πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 116 KB

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch

A parallel tabu search for conformationa
A parallel tabu search for conformational energy optimization of oligopeptides
✍ Morales, L. B.; GarduοΏ½o-JuοΏ½rez, R.; Aguilar-Alvarado, J. M.; Riveros-Castro, F. πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 213 KB πŸ‘ 2 views

We have developed and implemented a tabu search heuristic (TS) to determine the best energy minimum for oligopeptides. Our test molecule was Met-enkephalin, a pentapetide that over the years has been used as a validation model for many global optimizers. The test potential energy function was ECEPP/

New Tabu Search based global optimizatio
New Tabu Search based global optimization methods outline of algorithms and study of efficiency
✍ Svetlana Stepanenko; Bernd Engels πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 381 KB

## Abstract The study presents two new nonlinear global optimization routines; the Gradient Only Tabu Search (GOTS) and the Tabu Search with Powell's Algorithm (TSPA). They are based on the Tabu‐Search strategy, which tries to determine the global minimum of a function by the __steepest descent–mil