ScholarGate
Assistent
Process / pipelineSimulation / optimization

Robust Tabu Search — Tabu-põhine metaheuristika, mis on robustne ebakindluse suhtes

Robust Tabu Search (RTS) laiendab klassikalist Tabu Search metaheuristikat, hinnates kandidaatlahendusi mitte ainult nende nominaalse objektiivse väärtuse, vaid ka nende toimivuse alusel ebakindluse tingimustes. Selle asemel, et otsida parimat lahendust ühele stsenaariumile, otsib RTS lahendusi, mis toimivad hästi erinevates stsenaariumides või realizatsioonides, kaubeldes tipp-optaalsuse usaldusväärsuse nimel.

Ava rakenduses MethodMindPeagiVideoPeagiDownload slides

Loe meetodi täielikku kirjeldust

Ainult liikmetele

Selle osa lugemiseks logi sisse tasuta kontoga.

Logi sisse

Method map

The neighbourhood of related methods — select a node to explore.

Allikad

  1. Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI: 10.1287/ijoc.1.3.190
  2. Dolan, E. D., Lewis, R. M., & Torczon, V. (2003). On the local convergence of pattern search. SIAM Journal on Optimization, 14(2), 567–583. link

Kuidas sellele lehele viidata

ScholarGate. (2026, June 3). Robust Tabu Search — Tabu-based metaheuristic with robustness against uncertainty. ScholarGate. https://scholargate.app/et/simulation/robust-tabu-search

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Sellele viitavad

ScholarGateRobust Tabu Search (Robust Tabu Search — Tabu-based metaheuristic with robustness against uncertainty). Loetud 2026-06-15 aadressilt https://scholargate.app/et/simulation/robust-tabu-search · Andmestik: https://doi.org/10.5281/zenodo.20539026