Results 81 to 90 of about 2,726,346 (131)
Some of the next articles are maybe not open access.
Proceedings of the 9th annual conference on Genetic and evolutionary computation, 2007
Recombination in the Genetic Algorithm (GA) is supposed to extract the component characteristics from two parents and reassemble them in different combinations hopefully producing an offspring that has the good characteristics of both parents. Symbiotic Combination is formerly introduced as an alternative for sexual recombination operator to overcome ...
Ramin Halavati +3 more
openaire +1 more source
Recombination in the Genetic Algorithm (GA) is supposed to extract the component characteristics from two parents and reassemble them in different combinations hopefully producing an offspring that has the good characteristics of both parents. Symbiotic Combination is formerly introduced as an alternative for sexual recombination operator to overcome ...
Ramin Halavati +3 more
openaire +1 more source
Journal of Computational Chemistry, 2006
AbstractThis paper presents a modification of the tabu search called gradient tabu search (GTS). It uses analytical gradients for a fast minimization to the next local minimum and analytical diagonal elements of the Hessian to escape local minima. For an efficient blocking of already visited areas tabu regions and tabu directions are introduced into ...
Svetlana Stepanenko, Bernd Engels
openaire +2 more sources
AbstractThis paper presents a modification of the tabu search called gradient tabu search (GTS). It uses analytical gradients for a fast minimization to the next local minimum and analytical diagonal elements of the Hessian to escape local minima. For an efficient blocking of already visited areas tabu regions and tabu directions are introduced into ...
Svetlana Stepanenko, Bernd Engels
openaire +2 more sources
On the Convergence of Tabu Search
Journal of Heuristics, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Science China Information Sciences, 2021
Focal distance tabu search modifies a standard tabu search algorithm for binary optimization by augmenting a periodic diversification step that drives the search away from a current best (or elite) solution until the objective function deteriorates beyond a specified threshold or until attaining a lower bound on the distance from the originating ...
Fred W. Glover, Zhipeng Lü
openaire +2 more sources
Focal distance tabu search modifies a standard tabu search algorithm for binary optimization by augmenting a periodic diversification step that drives the search away from a current best (or elite) solution until the objective function deteriorates beyond a specified threshold or until attaining a lower bound on the distance from the originating ...
Fred W. Glover, Zhipeng Lü
openaire +2 more sources
Hashing vectors for tabu search
Annals of Operations Research, 1993Tabu search as proposed by Glover [3,4] has proven to be a very effective metaheuristic for hard problems. In this paper we propose that hash functions be used to record the solutions encountered during recent iterations of the search in a long list.
David L. Woodruff, Eitan Zemel
openaire +2 more sources
TSP in Partitioning with Tabu Search
2015Solving Territorial Design problems implies grouping territorial units into k of groups with compactness and/or contiguity restrictions. However each group formed is often treated in accordance to a conflict of interest; one of them is the routing problem.
María Beatríz Bernábe-Loranca +5 more
openaire +1 more source
Tabu search and design optimization
Computer-Aided Design, 1991Tabu search is a heuristic procedure for combinatorial optimization problems of a high degree of complexity. The paper is devoted to explain the fundamental tabu-search mechanism, to show how it may be applied to the layout design of electronic circuits, and to indicate possible future developments.
J. A. Bland, G. P. Dawson
openaire +2 more sources
Tabu search for graph partitioning
Annals of Operations Research, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erik Rolland +2 more
openaire +1 more source
Proposals for chunking and tabu search
European Journal of Operational Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
ORSA Journal on Computing, 1990
This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a probabilistic framework.
openaire +1 more source
This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a probabilistic framework.
openaire +1 more source