The VLSI placement problem is presented in this article. A mechanism of representation of solutions for further genetic algorithm implementation is described. The proposed encoding algorithm is based on a placement tree and reverse Polish notation. The decoding algorithm is implemented in two stages: twinning of elements in macroblocks and calculation of real coordinates of elements. Experimental results show time-response characteristics of the proposed coding and decoding mechanisms. The time complexity of the encoding algorithm is represented by O(n) whereas the time complexity of the decoding algorithm is represented by O(n log n), where n is the number of elements.

One of the important informational technologies problems, knowledge management problem based on the multi-agent simulation, is considered in the article. The knowledge management educational system (KMES) is founded on the acquisition, synthesis, exchange of knowledge in the learning environment. Statement of a problem is made. The simulation model of the learning process is offered. Authors suggested the structure and expert system of an intelligent agent. The transition graph is considered. The program environment and computing experiment is made. The series of tests and experiments have allowed specifying theoretical estimations of the algorithms running time.

The paper considers one of the important design problems – a partitioning of electronic computer equipment (ECE) components (blocks). It belongs to the NP-hard class of problems and has a combinatorial and logic nature. In the paper, a partitioning problem formulation can be found as a partition of graph into parts. To solve the given problem, the authors suggest using a bioinspired approach based on a monkey search algorithm. Based on the developed software, computational experiments were carried out that show the algorithm efficiency, as well as its recommended settings for obtaining more effective solutions in comparison with a genetic algorithm.