Effectiveness of Genetic Algorithm in the Solution of Multidisciplinary Conference Scheduling Problem

Multidisciplinary conferences are the types of conferences that allow the presentation of studies in different disciplines such as naturel science, social sciences, health and arts sciences etc. In these conferences, determining the days, halls and sessions and making presentations according to the related main-scope and sub-scopes, are an important limited optimization problem. The fact that there are presentations from different disciplines in same session during the conference is a big problem for the conference participants. In this study, the solution of the scheduling problem of multidisciplinary conferences with Genetic Algorithm approach is discussed. The basic concepts of Genetic Algorithm are given and conference scheduling schemes and the elements to be considered in scheduling are indicated. In this study, two different multidisciplinary conference datasets have been used. An application has been developed with Genetic Algorithm in C# language under some constraints of the different days, different sessions and different rooms. As a result of the study, it is seen that the solutions obtained with Genetic Algorithm are generally close to optimum solutions. © 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.2-s2.0-8510989010