Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Tabu Search

Chapter 20
Handbook of Research on Natural Computing for Optimization Problems
It generally travels to its surrounding stages exhibiting lower diminished energy, but might also mount higher in hill like pattern to allow it to get attained in a position having local minimum. It further and evade those cycles by preserving a “taboo list” of deductions visualized and attained already.
Published in Chapter:
Adaptive Simulated Annealing Algorithm to Solve Bio-Molecular Optimization
Sujay Ray (University of Kalyani, India)
Copyright: © 2016 |Pages: 15
DOI: 10.4018/978-1-5225-0058-2.ch020
Abstract
Energy minimization is a paramount zone in the field of computational and structural biology for protein modeling. It helps in mending distorted geometries in the folded functional protein by moving its atoms to release internal constraints. It attempts to hold back to zero value for the net atomic force on every atom. But to overcome certain disadvantages in energy minimization, Simulated Annealing (SA) can be helpful. SA is a molecular dynamics technique, where temperature is gradually reduced during the simulation. It provides the best configuration of bio-molecules in shorter time. With the advancement in computational knowledge, one essential but less sensitive variant of SA: Adaptive Simulated Annealing (ASA) algorithm is beneficial, because it automatically adjusts the temperature scheme and abrupt opting of step. Therefore it benefits to prepare stable protein models and further to investigate protein-protein interactions. Thus, a residue-level study can be analyzed in details for the benefit of the entire biota.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Chapter 126
Hybrid Meta-Heuristics Based System for Dynamic Scheduling
A approximation method, belonging to the class of local search techniques, that enhances the performance of a local search method by using memory structures (Tabu List).
Published in Chapter: Hybrid Meta-Heuristics Based System for Dynamic Scheduling; From: Encyclopedia of Artificial Intelligence
Full Text Chapter Download: US $37.50 Add to Cart
Chapter 68
Designing Supply Chains Using Optimization
Approximate algorithm that locally searches a potential solution to a problem by checking its immediate neighbor.
Published in Chapter: Designing Supply Chains Using Optimization; From: Encyclopedia of Business Analytics and Optimization
Full Text Chapter Download: US $37.50 Add to Cart
Chapter 15
Combined Electromagnetism-Like Algorithm with Tabu Search to Scheduling
Tabu search (TS) is a local search procedure to explore the solution space beyond local optimality. Memory-based strategy is the property of TS approaches.
Published in Chapter: Combined Electromagnetism-Like Algorithm with Tabu Search to Scheduling; From: Handbook of Research on Artificial Intelligence Techniques and Algorithms
Full Text Chapter Download: US $37.50 Add to Cart
Chapter 16
A Structured Tabu Search Approach for Scheduling in Parallel Computing Systems
Is an intelligent, iterative Hill Descent algorithm, which avoids local minima by using short- and long-term memory. It has gained a number of key influences from a variety of sources; these include early surrogate constraint methods and cutting plane approaches. Tabu search incorporates adaptive memory and responsive exploration as prime aspects of the search.
Published in Chapter: A Structured Tabu Search Approach for Scheduling in Parallel Computing Systems; From: Handbook of Research on Scalable Computing Technologies
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR