An extended Tabu algorithm with an aspiration factor is proposed. The algor
ithm is based on the success of techniques such as the memorization of the
previously visited subspaces, the systematic diversification as well as the
intensification process for neighborhood creations. The numerical results
obtained by solving a mathematical test function and the benchmark problem
22 of the TEAM Workshop reported in this paper will demonstrate the usefuln
ess of the proposed method.