ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Bayesovo tabu pretraživanje×Simulirano žarenje×
PodručjeSimulacijaOptimizacija
ObiteljProcess / pipelineProcess / pipeline
Godina nastanka1989 (tabu search); hybrid formulations ~2005–20151983
TvoracGlover, F. (tabu search); Bayesian integration developed by multiple researchers in the 2000s–2010s
VrstaHybrid metaheuristic — memory-based local search with Bayesian probabilistic guidanceProbabilistic metaheuristic / local search
Temeljni izvorGlover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI ↗Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗
Drugi naziviBTS, Bayesian-guided tabu search, probabilistic tabu search, Bayes-TSBenzetimli Tavlama (Simulated Annealing), SA, probabilistic local search
Srodne65
SažetakBayesian Tabu Search (BTS) is a hybrid metaheuristic that couples the memory-based forbidden-move mechanism of classic Tabu Search with a Bayesian probabilistic model. The Bayesian component learns from past evaluations to score candidate moves, focusing the search on promising regions while the tabu list prevents cycling. This combination reduces wasted function evaluations in expensive combinatorial and continuous optimization problems.Simulated annealing is a probabilistic local-search metaheuristic introduced by Kirkpatrick, Gelatt, and Vecchi in 1983. It models the physical annealing process in metallurgy — where a material is heated and then slowly cooled to reach a low-energy crystalline state — and uses this analogy to escape local optima in combinatorial and continuous optimization problems.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Bayesian Tabu Search · Simulated Annealing. Preuzeto 2026-06-18 s https://scholargate.app/hr/compare