Diversification-based learning in computing and optimization

@article{Glover2019DiversificationbasedLI,
  title={Diversification-based learning in computing and optimization},
  author={Fred W. Glover and Jin-Kao Hao},
  journal={Journal of Heuristics},
  year={2019},
  pages={1-17}
}
Diversification-based learning (DBL) derives from a collection of principles and methods introduced in the field of metaheuristics that have broad applications in computing and optimization. We show that the DBL framework goes significantly beyond that of the more recent opposition-based learning (OBL) framework introduced in Tizhoosh (in: Proceedings of international conference on computational intelligence for modelling, control and automation, and international conference on intelligent… 
A Learning-Based Hybrid Framework for Dynamic Balancing of Exploration-Exploitation: Combining Regression Analysis and Metaheuristics
TLDR
The present work is concerned with contributing with a novel optimisation framework, named learning-based linear balancer (LB2), which is designed to predict better movements for the approach and improve the performance, and concludes that the hybrid approach is a competitive alternative in the optimisation field.
Diversification-based learning simulated annealing algorithm for hub location problems
TLDR
This study finds that in hub location models, DBLSA algorithm equipped with social learning operator outperforms the vanilla version of SA algorithm in terms of accuracy and convergence rates.
Enhancing Cuckoo Search Algorithm by using Reinforcement Learning for Constrained Engineering optimization Problems
  • M. Shehab, A. Khader, M. Alia
  • Computer Science
    2019 IEEE Jordan International Joint Conference on Electrical Engineering and Information Technology (JEEIT)
  • 2019
TLDR
The results demonstrate that the CSARL outperforms the basic CSA, genetic, harmony search and krill heard algorithms, in terms of convergence speed, the diversity, and exploration search.
Diversification methods for zero-one optimization
TLDR
New diversification methods for zero-one optimization that significantly extend strategies previously introduced in the setting of metaheuristic search are introduced and can be applied to non-binary vectors using binarization procedures and by diversification-based learning procedures that provide connections to applications in clustering and machine learning.
A History of Metaheuristics
TLDR
In this talk, this history is not a chronological list of ``important contributions'', but rather divides time into five distinct periods, defined by important shifts in the metaheuristic paradigm.
ARZ-TALEP TABANLI OPTİMİZASYON ALGORİTMASININ FDB YÖNTEMİ İLE İYİLEŞTİRİLMESİ: MÜHENDİSLİK TASARIM PROBLEMLERİ ÜZERİNE KAPSAMLI BİR ARAŞTIRMA
Bu makale calismasinda son zamanlarda gelistirilmis guncel bir meta-sezgisel arama (MSA) yontemi olan arz-talep tabanli (Supply-Demand-Based Optimization, SDO) algoritmasinin iyilestirilmis bir
An Adoption Model of Mobile Knowledge Sharing Based on the Theory of Planned Behavior
TLDR
An adoption model of mobile phone technology knowledge sharing is built based on the Theory of Planned Behavior, in which perceived enjoyment, facilitating conditions, interpersonal influences, perceived usefulness, external influence, mobility, self- efficacy, and perceived ease of use of mobile sharing knowledge are integrated in order to increase the predictive capability of model.

References

SHOWING 1-10 OF 35 REFERENCES
Center-based sampling for population-based algorithms
TLDR
Simulation results confirm that this center-based sampling, which can be utilized during population initialization and/or generating successive generations, could be valuable in solving large-scale problems efficiently.
Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms)
Opposition-Based Differential Evolution
TLDR
This paper presents a novel algorithm to accelerate the differential evolution (DE), which employs opposition-based learning (OBL) for population initialization and also for generation jumping and results confirm that the ODE outperforms the original DE and FADE in terms of convergence speed and solution accuracy.
Opposition-Based Memetic Search for the Maximum Diversity Problem
TLDR
An opposition-based memetic algorithm (OBMA) is presented, which integrates the concept of opposition- based learning (OBL) into the well-known memetic search framework, and finds improved best solutions for 22 instances of MDP.
Survey of oppositional algorithms
  • Mehmet Ergezer, I. Sikder
  • Computer Science
    14th International Conference on Computer and Information Technology (ICCIT 2011)
  • 2011
TLDR
BBO is combined with five different oppositional methods and a new oppositional algorithm, fitness-ranking-based central opposition (FCB), is introduced for the first time and is determined to be the oppositional algorithms with the highest success rate.
Parametric tabu-search for mixed integer programs
Tabu Search
From the Publisher: This book explores the meta-heuristics approach called tabu search, which is dramatically changing our ability to solve a hostof problems that stretch over the realms of resource
...
...