A tabu search Hooke and Jeeves algorithm for unconstrained optimization
Article Abstract:
A new algorithm for global optimization can yield promising and efficient results, considering that it never failed in seeking for global minimum in all tested problems. The algorithm is considered hybrid since search directions are produced by adopting a tabu search approach and used in an optimization algorithm. The optimization technique of Hooke and Jeeves in which directions are produced randomly ia used by the new algorithm.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
Simulated annealing for discrete optimization with estimation
Article Abstract:
A study was conducted to extend the basic convergence results for the Simulated Annealing algorithm to a stochastic optimization problem where the objective function is stochastic and can be examined through Monte Carlo simulation. A modified simulated annealing algorithm that can converge in probability to a global optimizer was developed. Results indicated a number of complexities in the application of convergence properties.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
User Contributions:
Comment about this article or add new information about this topic:
A modified Hooke and Jeeves algorithm with likelihood ratio performance extrapolation for simulation optimization
Article Abstract:
A study uses simulation optimization to evaluate the Hooke and Jeeves algorithm in non-linear functions. A computational analysis is done in the study.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A fast tabu search algorithm for the permutation flow-shop problem
- Abstracts: Strip generation algorithms for constrained two-dimensional two-staged cutting problems. A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
- Abstracts: A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. Iterated local search for the quadratic assignment problem
- Abstracts: Portfolio rebalancing model with transaction costs based on fuzzy decision theory. Rating technical attributes in fuzzy QFD by integrating fuzzy weighted average method and fuzzy expected value operator
- Abstracts: Direct shipping and the dynamic single-depot/multi-retailer inventory system. An inventory model for delayed customization: a hybrid approach