| F. Glover, Tabu search, Fred Glover, Manuel Laguna. Boston: Kluwer Academic Publishers, 1997. |
.... algorithm begins with an initial configuration s 0 # S and then generates a series of configurations (s i ) i# 0,1, such that #i # 0, 1, s i 1 # N(s i ) Well known examples of LS methods include various descent methods, simulated annealing (SA) 7] and Tabu Search (TS) [4, 5]. The main di#erence among LS methods concerns the way of visiting the given neighborhood. Several LS methods, called repair methods, have been developed to solve CSPs in Artificial Intelligence. One well known example is the Min conflict (MC) heuristic [10] With this heuristic, one seeks for a ....
....e#ect of the chosen move on the cost function. If the move m does not increase the cost function (# # 0) then it is always accepted. If it does (# 0) the move is accepted with a probability e # # so that a bigger deterioration is more rarely accepted. Tabu algorithm A typical TS procedure [4] begins with an initial configuration in the search space S and then proceeds iteratively to visit a series of locally best configurations following the neighborhood. At each iteration, a best move m is applied to the current configuration s even if s # = s # m does not improve the current ....
F. Glover and M. Laguna, Tabu Search, USA, Boston: Kluwer Academic Publishers, 1997.
No context found.
F. Glover, Tabu search, Fred Glover, Manuel Laguna. Boston: Kluwer Academic Publishers, 1997.
No context found.
F. Glover. Tabu search. Fred Glover, Manuel Laguna. Boston: Kluwer Academic Publishers, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC