Convergence of an annealing algorithm
Mathematical Programming: Series A and B
What makes an optimization problem hard?
Complexity
Applied Mathematics and Computation
Global optimization requires global information
Journal of Optimization Theory and Applications
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
The Nonstochastic Multiarmed Bandit Problem
SIAM Journal on Computing
Journal of Global Optimization
Finite-time Analysis of the Multiarmed Bandit Problem
Machine Learning
Control of exploitation-exploration meta-parameter in reinforcement learning
Neural Networks - Computational models of neuromodulation
Building Better Test Functions
Proceedings of the 6th International Conference on Genetic Algorithms
Diversity-Guided Evolutionary Algorithms
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
The particle swarm optimization algorithm: convergence analysis and parameter selection
Information Processing Letters
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Genetic diversity as an objective in multi-objective evolutionary algorithms
Evolutionary Computation
Using confidence bounds for exploitation-exploration trade-offs
The Journal of Machine Learning Research
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
The Journal of Machine Learning Research
On the importance of diversity maintenance in estimation of distribution algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Local and global order 3/2 convergence of a surrogate evolutionary algorithm
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Interval Branch and Bound with Local Sampling for Constrained Global Optimization
Journal of Global Optimization
On the Design of Optimization Strategies Based on Global Response Surface Approximation Models
Journal of Global Optimization
An autonomous explore/exploit strategy
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Linkage Problem, Distribution Estimation, and Bayesian Networks
Evolutionary Computation
PSO and multi-funnel landscapes: how cooperation might limit exploration
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Simulation optimization using balanced explorative and exploitative search
WSC '04 Proceedings of the 36th conference on Winter simulation
Journal of Global Optimization
On initial populations of a genetic algorithm for continuous optimization problems
Journal of Global Optimization
Multi-funnel optimization using Gaussian underestimation
Journal of Global Optimization
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Bandit problems and the exploration/exploitation tradeoff
IEEE Transactions on Evolutionary Computation
A comparison of predictive measures of problem difficulty inevolutionary algorithms
IEEE Transactions on Evolutionary Computation
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
A short convergence proof for a class of ant colony optimizationalgorithms
IEEE Transactions on Evolutionary Computation
The balance between proximity and diversity in multiobjective evolutionary algorithms
IEEE Transactions on Evolutionary Computation
A Cooperative approach to particle swarm optimization
IEEE Transactions on Evolutionary Computation
The exploration/exploitation tradeoff in dynamic cellular genetic algorithms
IEEE Transactions on Evolutionary Computation
Multiswarms, exclusion, and anti-convergence in dynamic environments
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
A genetic algorithm with disruptive selection
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An Effective PSO-Based Hybrid Algorithm for Multiobjective Permutation Flow Shop Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
IEEE Transactions on Neural Networks
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
International Journal of Metaheuristics
Review: A parameter selection strategy for particle swarm optimization based on particle positions
Expert Systems with Applications: An International Journal
A computational intelligence optimization algorithm: Cloud drops algorithm
Integrated Computer-Aided Engineering
Hi-index | 0.00 |
Global optimization process can often be divided into two subprocesses: exploration and exploitation. The tradeoff between exploration and exploitation (T:Er&Ei) is crucial in search and optimization, having a great effect on global optimization performance, e.g., accuracy and convergence speed of optimization algorithms. In this paper, definitions of exploration and exploitation are first given based on information correlation among samplings. Then, some general indicators of optimization hardness are presented to characterize problem difficulties. By analyzing a typical contraction-based three-stage optimization process, Optimal Contraction Theorem is presented to show that T:Er&Ei depends on the optimization hardness of problems to be optimized. T:Er&Ei will gradually lean toward exploration as optimization hardness increases. In the case of great optimization hardness, exploration-dominated optimizers outperform exploitation-dominated optimizers. In particular, random sampling will become an outstanding optimizer when optimization hardness reaches a certain degree. Besides, the optimal number of contraction stages increases with optimization hardness. In an optimal contraction way, the whole sampling cost is evenly distributed in all contraction stages, and each contraction takes the same contracting ratio. Furthermore, the characterization of optimization hardness is discussed in detail. The experiments with several typical global optimization algorithms used to optimize three groups of test problems validate the correctness of the conclusions made by T:Er&Ei analysis.