We encounter the arrangement problem while making classroom seating plans, organizing knowledge competitions, organizing weddings and other similar events. This is one of those problems that seem trivial at first, because the rules of creating a seating plan are usually simple and understandable. As a result, the organizers of the above-mentioned events often decide to create a seating plan by hand, which becomes one of the most time-consuming tasks of the organizers. In this thesis, we defined the arrangement problem and proved it to be NP-complete. Furthermore, we created a web application that allows its users an automatic creation of seating plans. In addition to the automatic creation of seating plans, the application also includes user interfaces for entering the data of the seated persons, for creating seat topologies and for displaying the final seating plan.
|
