Tabu search in case-based reasoning

The successful design of case-based reasoning (CBR) systems depends chiefly on high-efficiency retrieval strategy of case library. In this paper, the author focuses on an original case retrieval approach using tabu search (TS) method. TS is a meta-heuristic approach designed skillfully for finding a suboptimal solution of combinational optimization problems. It is shown how this method can be used to speed up the case retrieval. The preliminary results obtained by our approach let us conclude that TS is a robust and promising technique to be applied into CBR.