A study on adaptive ε-ranking and tabu moves in random one-bit climbers for many-objective optimization

Joseph M. Pasia, Hernan E. Aguirre, Kiyoshi Tanaka · International Journal of Hybrid Intelligent Systems · 2012

Multi-objective random one-bit climbers (moRBCs) are one class of stochastic local search-based algorithms that maintain a reference population of solutions to guide their search. They have been shown to perform well in solving multi-objective optimi

Read the paper · More papers on PaperTik