TY - JOUR

T1 - Neural Combinatorial Optimization on Heterogeneous Graphs

T2 - 34th International Conference on Automated Planning and Scheduling

AU - Luttmann, Laurin

AU - Xie, Lin

N1 - Conference code: 34

PY - 2024/5/30

Y1 - 2024/5/30

N2 - In recent years, machine learning (ML) models capable of solving combinatorial optimization (CO) problems have received a surge of attention. While early approaches failed to outperform traditional CO solvers, the gap between handcrafted and learned heuristics has been steadily closing. However, most work in this area has focused on simple CO problems to benchmark new models and algorithms, leaving a gap in the development of methods specifically designed to handle more involved problems. Therefore, this work considers the problem of picker routing in the context of mixed-shelves warehouses, which involves not only a heterogeneous graph representation, but also a combinatorial action space resulting from the integrated selection and routing decisions to be made. We propose both a novel encoder to effectively learn representations of the heterogeneous graph and a hierarchical decoding scheme that exploits the combinatorial structure of the action space. The efficacy of the developed methods is demonstrated through a comprehensive comparison with established architectures as well as exact and heuristic solvers.

AB - In recent years, machine learning (ML) models capable of solving combinatorial optimization (CO) problems have received a surge of attention. While early approaches failed to outperform traditional CO solvers, the gap between handcrafted and learned heuristics has been steadily closing. However, most work in this area has focused on simple CO problems to benchmark new models and algorithms, leaving a gap in the development of methods specifically designed to handle more involved problems. Therefore, this work considers the problem of picker routing in the context of mixed-shelves warehouses, which involves not only a heterogeneous graph representation, but also a combinatorial action space resulting from the integrated selection and routing decisions to be made. We propose both a novel encoder to effectively learn representations of the heterogeneous graph and a hierarchical decoding scheme that exploits the combinatorial structure of the action space. The efficacy of the developed methods is demonstrated through a comprehensive comparison with established architectures as well as exact and heuristic solvers.

KW - Informatics

KW - Business informatics

UR - http://www.scopus.com/inward/record.url?scp=85195895250&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/902ad777-11b2-3244-a109-e5a0f7792fbd/

U2 - 10.1609/icaps.v34i1.31494

DO - 10.1609/icaps.v34i1.31494

M3 - Conference article in journal

AN - SCOPUS:85195895250

VL - 34

SP - 351

EP - 359

JO - Proceedings International Conference on Automated Planning and Scheduling, ICAPS

JF - Proceedings International Conference on Automated Planning and Scheduling, ICAPS

SN - 2334-0835

Y2 - 1 June 2024 through 6 June 2024

ER -