Results 241 to 250 of about 64,596 (288)
Some of the next articles are maybe not open access.
1997
The abundance of difficult optimization problems encountered in practical settings such as telecommunications, logistics, financial planning, transportation, and production has motivated the development of powerful optimization techniques. These techniques are usually the result of adapting ideas from a variety of research areas. The hope is to develop
Fred Glover, Manuel Laguna
openaire +1 more source
The abundance of difficult optimization problems encountered in practical settings such as telecommunications, logistics, financial planning, transportation, and production has motivated the development of powerful optimization techniques. These techniques are usually the result of adapting ideas from a variety of research areas. The hope is to develop
Fred Glover, Manuel Laguna
openaire +1 more source
Efficiency of tabu‐search‐based conformational search algorithms
Journal of Computational Chemistry, 2011AbstractEfficient conformational search or sampling approaches play an integral role in molecular modeling, leading to a strong demand for even faster and more reliable conformer search algorithms. This article compares the efficiency of a molecular dynamics method, a simulated annealing method, and the basin hopping (BH) approach (which are widely ...
Christoph, Grebner +3 more
openaire +2 more sources
1997
This chapter describes concepts and issues that are important for an effective application of the TS methodology and that merit fuller investigation. We begin by re-examining the notion of influence, followed by considering the generation of compound moves.
Fred Glover, Manuel Laguna
openaire +1 more source
This chapter describes concepts and issues that are important for an effective application of the TS methodology and that merit fuller investigation. We begin by re-examining the notion of influence, followed by considering the generation of compound moves.
Fred Glover, Manuel Laguna
openaire +1 more source
1997
This chapter provides a collection of “vignettes” that briefly summarize applications of tabu search in a variety of settings. These vignettes are edited versions of reports by researchers and practitioners who are responsible for the applications The TS research summarized in this chapter was contributed by academicians and practitioners from all over
Fred Glover, Manuel Laguna
openaire +1 more source
This chapter provides a collection of “vignettes” that briefly summarize applications of tabu search in a variety of settings. These vignettes are edited versions of reports by researchers and practitioners who are responsible for the applications The TS research summarized in this chapter was contributed by academicians and practitioners from all over
Fred Glover, Manuel Laguna
openaire +1 more source
Tabu Search and Scatter Search
2016Tabu search is a single-solution-based stochastic metaheuristic global optimization method. It is a hill-climbing method that imitates human memory structure to improve decision-making. Scatter search is a population-based metaheuristic algorithm. Scatter search and its generalized form called path relinking are intimately related to tabu search, and ...
Ke-Lin Du, M. N. S. Swamy
openaire +1 more source
Korean Journal of Computational & Applied Mathematics, 2001
Summary: A heuristic method TABU-CSP using Tabu Search (TS) is described for solving Constraint Satisfaction Problems (CSPs). The method is started with a complete but inconsistent solution of a binary CSP and obtained in prespecified number of iterations either a consistent solution or a near optimal solution with an acceptable number of conflicts ...
openaire +2 more sources
Summary: A heuristic method TABU-CSP using Tabu Search (TS) is described for solving Constraint Satisfaction Problems (CSPs). The method is started with a complete but inconsistent solution of a binary CSP and obtained in prespecified number of iterations either a consistent solution or a near optimal solution with an acceptable number of conflicts ...
openaire +2 more sources
Interfaces, 1990
Tabu search is a “higher level” heuristic procedure for solving optimization problems, designed to guide other methods (or their component processes) to escape the trap of local optimality. Tabu search has obtained optimal and near optimal solutions to a wide variety of classical and practical problems in applications ranging from scheduling to ...
openaire +1 more source
Tabu search is a “higher level” heuristic procedure for solving optimization problems, designed to guide other methods (or their component processes) to escape the trap of local optimality. Tabu search has obtained optimal and near optimal solutions to a wide variety of classical and practical problems in applications ranging from scheduling to ...
openaire +1 more source
Wind turbine power curve modeling using radial basis function neural networks and tabu search
Renewable Energy, 2021Alex Alexandridis
exaly