+7 (495) 987 43 74 ext. 3304
Join us -              
Рус   |   Eng

Authors

Gushchina O.

Degree
PhD in Pedagogical sciences, Associate Professor, Togliatti State University
E-mail
g_o_m@tltsu.ru
Location
Togliatti
Articles

Using technology table simulation genetic algorithms for solving optimization problems

The article shows the feasibility of genetic and evolutionary algorithms, based on the technique of creating iterative models tabular means Microsoft Excel on a «programming without programming,» without the use of software code in VBA language. Genetic algorithms in conjunction with evolutionary strategies are two main directions of evolutionary modeling. With their help can be found solving many complex problems in various areas, such as software development, systems of artificial intelligence, optimization, artificial neural networks, and other branches of knowledge. Presented in the article table model genetic algorithm proves that the tabular method, you can create simulation models of algorithms that were previously implemented only with the use of specialized simulation systems, or by programming. It should be noted that the above table model can be easily modified and extended (the size of chromosomes and the number of individuals in the population), and the proposed technique table simulation genetic algorithms can be successfully used for other, more complex optimization problems. Developed with the help of the proposed simulation models allow technology to virtualize laboratory training course in many disciplines — scientific and economic profiles, increase the efficiency of educational process in high schools, as characterized by exceptional clarity, ease of analysis, the implementation of experiments, a visual representation of the results. The results are of interest to specialists in the optimization of systems and processes, as well as for teachers, advanced students and students of higher educational institutions.
Read more...

Table modeling of the dynamics of the operation of a single-channel queuing system with a limited queue

The implementation of a table-modeling queuing system is based on the algorithm of the simulated system functions without writing the programs code. This was developed by algorithmic models in Microsoft Excel based on the principle of «programming without programming». The simulation algorithm consists of the queuing system changing steps with discreteness in time, and the new state — which the system moves to the next step — is determined by its state in the previous step. Thus, step by step, the state of the queuing system is simulated, which in turn simulates the process functions of the queuing system. When constructing a queuing system table model, only the minimum information necessary is used for solving the problem, which transforms into intermediate results. This is necessary and sufficient to obtain the result. In this paper, we prove the possibility of using spreadsheets as a convenient and effective simulation environment for a class of systems that represent a random process, with discrete states and continuous time. The use of the presented table models in the educational process increase in effectiveness, as it allows demonstrating visual results of the functioning of dynamic systems and processes. It provides ample opportunities for conducting model experiments and visual representation of simulation results. The developed table models of computational algorithms can be used in a practical computerized practical set of disciplines, in which questions of queuing theory are touched upon.
Read more...