Short-term and long-term memory in Tabu search algorithm for CAD of complex systems with higher degree of dependability

Abstract

The paper introduces a proposal of a new algorithm for Computer Aided Design (CAD) of complex system with higher degree of dependability. This algorithm optimizes tasks scheduling, resources partition and the allocation of tasks and resources. Complexity of computation for decision versions of these optimization problems is NP-complete, so solved efficiently e.g. by meta-heuristic algorithms. Presented in this paper algorithm is based on Tabu Search method. It may have a practical application in developing tools for rapid prototyping of such systems. The Tabu Search method uses memory structures. This structures describe the found solutions or provide sets of rules for consideration only new solutions.