Algorithm "Crossing" (Algorithm for programming tasks of multi-agent modeling using methods of discrete-event modeling)

Abstract

The “Crossing” algorithm considered in this article was used in the educational process when teaching the disciplines “Simulation modeling” and “Multi-agent modeling”. Students first performed a similar task in the AnyLogic environment, but students practically do not master programming skills in AnyLogic. That is why they solve this problem both in the AnyLogic environment and in a certain environment of the corresponding programming language of their choice. To solve this problem, it is good to use a visual programming environment. The considered environment can use the table control (see Figure 1). But as our teaching experience has shown, students could do without this element. Some even solved this problem when the computer monitor was not in graphic mode, but in text mode. Such a solution, of course, is less expressive, but quite acceptable. So practice has shown that this algorithm can be used by students who have different levels in programming and have programming experience in different languages. When completing tasks, students can somewhat modify the execution of events in it, for example, people can come to the pier or go to the raft not one at a time, but in formation. But overall, it should do the job.

The algorithm can also be modified and complicated during the educational process, for example, the raft in it can be replaced by an elevator cabin that will move through the floors, transporting people from one floor to another, there can be not only two floors, but when the algorithm becomes more complicated, its essence will remain the same.