The Search Algorithms have been introduced in the paper [3][6] under the name â€˜Search via Probability Algorithmâ€™. These optimization techniques converge very fast and are very efficient for solving optimization problems with very large scale feasible domains. But these optimization techniques are not effective in solving the numerical optimization problems with long narrow feasible domains. In this paper, we calculate probabilities of the appearance of a better solution than the current one on each iteration, and on the performance of the algorithm we create good conditions for its appearance, we improve the algorithm to search and determine the correct values for each digit from left to right of variables of a solution for solving numerical optimization problems with long narrow feasible domains. We tested the improved algorithm on some engineering optimization problems with feasible domain is very narrow, and have obtained better results than the results found by other algorithms.

## Citation

Thong N. H. (11/2012), "A new Search via Probability Algorithm for solving Engineering Optimization Problems", Journal of science, Special issue: Natural sciences and Technology, Ho Chi Minh city: University of Pedagogy, 40(74), pp. 23-33.