Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/306386 
Erscheinungsjahr: 
2022
Quellenangabe: 
[Journal:] Operations Research Forum [ISSN:] 2662-2556 [Volume:] 3 [Issue:] 3 [Article No.:] 42 [Publisher:] Springer International Publishing [Place:] Cham [Year:] 2022
Verlag: 
Springer International Publishing, Cham
Zusammenfassung: 
In this paper, the IT-speed dating of a German university is considered, where students have talks with different companies in order to find a suitable internship. The goal is to create a good and fair matching of students and companies for these talks, based on student preferences, and to schedule the resulting talks in order to maintain the given time horizon and minimize the necessary room changes for the students. We solved the problem in two steps. First, we modeled the matching problem as an extended version of the capacitated transportation problem and solved it using a modified stepping stone method. Second, we present two approaches to solve the scheduling problem. A Monte Carlo tree search procedure generates time-constrained schedules with minimal duration, while a genetic algorithm generates longer schedules with individual pauses and fewer room changes. The approaches led to significantly more talks with valuable content, a shorter duration, and greater satisfaction of all participants.
Schlagwörter: 
Matching and scheduling
Modified stepping stone method
Mixed-integer linear programming
Monte Carlo tree search
Genetic algorithm
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article
Dokumentversion: 
Published Version

Datei(en):
Datei
Größe





Publikationen in EconStor sind urheberrechtlich geschützt.