An On-line Multi-CBR Agent Dispatching Algorithm

Abstract

Case-based reasoning (CBR) is an effective and fast problem-solving methodology, which solves new problems by remembering and adaptation of past cases. With the increasing requests for useful references for all kinds of problems and from different locations, keeping a single CBR system seems to be outdated and not practical. Multi-CBR agents located in different places are of great support to fast meet these requests. In this paper, the architecture of a multi-CBR agent system is proposed, where the CBR agents locate at different places, and are assumed to have the same ability to deal with new problem independently. When the requests in a request queue from different places are coming one by one, we propose a new policy of dispatching which agent to satisfy the request queue. Throughout the paper, we assume that the system must solve the coming request by considering only past requests. In this context, the performance of traditional greedy algorithms is not satisfactory. We apply a new but simple approach --- competitive algorithm for on-line problem (called On-line multi-CBR agent dispatching algorithm) to determine the dispatching policy to keep comparative low cost. The corresponding on-line dispatching algorithm is proposed and the competitive ratio is given. Based on the competitive algorithm, the dispatching of multi-CBR agents is optimized.