Simulation optimization research and development
Proceedings of the 30th conference on Winter simulation
`` Direct Search'' Solution of Numerical and Statistical Problems
Journal of the ACM (JACM)
Evolutionary Optimization in Dynamic Environments
Evolutionary Optimization in Dynamic Environments
Designing evolutionary algorithms for dynamic optimization problems
Advances in evolutionary computing
B-Cell Algorithm as a Parallel Approach to Optimization of Moving Peaks Benchmark Tasks
CISIM '07 Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications
A new collaborative evolutionary-swarm optimization technique
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Experimental analysis of the aging operator for static and dynamic optimisation problems
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part III
| Hi-index | 0.00 |
The Hooke-Jeeves (HJ) Pattern Search, which seems to be the most popular choice among the local search algorithms, was used as an alternative to the dimensional local search (DLS), which has provided excellent results in previous work. In this paper, the question whether the well-known Hooke-Jeeves pattern search could outperform the DLS algorithm that was devised somewhat ad-hoc, is to be investigated. The Moving Peaks (MP) function is used as a benchmark. In our experiments, the algorithms performed almost identically well on the problem instances used. However, it was observed that the pattern move, an intrinsic part of the HJ algorithm, hardly contributed to the quality of the outcome, in fact less than the number sequence used as step sizes for both local searches. We provide some investigations into why the pattern move is less successful than most authors - including the original inventors of the Hooke-Jeeves search - seem to anticipate.