Focusing on what an optimization problem may comply with, the so-called convergence conditions have been proposed and sequentially a stochastic optimization algorithm named as DSZ algorithm is presented in order to deal with both unconstrained and constrained optimizations. Its principle is discussed in the theoretical model of DSZ algorithm, from which we present a practical model of DSZ algorithm. Practical model’s efficiency is demonstrated by comparison with similar algorithms such as Enhanced Simulated Annealing (ESA), Monte Carlo Simulated Annealing (MCS), Sniffer Global Optimization (SGO), Directed Tabu Search (DTS), and Genetic Algorithm (GA), using a set of well-known both unconstrained and constrained optimization test cases. Meanwhile, further attention goes to the strategy how to optimize the high-dimensional unconstrained problems using DSZ algorithm.
Submitted to Journal of heuristic on July 1,2008