Abstract
Many real-world processes are of dynamic nature and therefore subject to change. In this paper, dynamic warehouse operations are taken care of, more specifically crane operations that involve moving steel coils between storage locations within a large warehouse. An open-ended optimization approach is employed to create an optimal schedule of crane moves given a set of requested crane operations. Conventionally, the problem model defines static crane speeds and service times, the time needed to pickup and dropoff coils from/to locations. In a dynamic environment, these properties can depend on a variety of factors, including the proficiency of the crane operator or the storage locations that are accessed. Therefore, an open-ended genetic algorithm is enhanced with integrated machine learning (IML) tasked with learning crane speeds and service times from historical data and adapting said properties in the underlying problem model in order to provide the optimizer with a more realistic view on the current world state. To understand the performance gain achieved by this enhancement, experimental setups with and without IML are evaluated. The results show that IML improves the optimizer’s performance, as the algorithm gains better understanding of the current world state and is therefore able to create more suitable schedules, considering the crane’s current performance.
Original language | English |
---|---|
Title of host publication | Procedia Computer Science |
Pages | 1031 |
Number of pages | 1040 |
Volume | 200 |
Publication status | Published - 2022 |
Event | International Conference on Industry 4.0 and Smart Manufacturing - Hagenberg, Austria Duration: 17 Nov 2021 → 19 Nov 2021 |
Conference
Conference | International Conference on Industry 4.0 and Smart Manufacturing |
---|---|
Abbreviated title | ISM 2021 |
Country/Territory | Austria |
City | Hagenberg |
Period | 17.11.2021 → 19.11.2021 |
Keywords
- open-ended optimization
- dynamic optimization
- crane scheduling
- machine learning
- genetic algorithm