Sender, JuliaJuliaSenderSiwczyk, ThomasThomasSiwczykMutzel, PetraPetraMutzelClausen, UweUweClausen2022-03-052022-03-052017https://publica.fraunhofer.de/handle/publica/24966310.1007/s13675-016-0076-9In this paper, we consider a capacitated multiple allocation hub location problem derived from a practical application in network design of German wagonload traffic. Due to the difficulty to solve even small data sets to optimality, we present two matheuristics: a local search matheuristic and an extension of an evolutionary algorithm matheuristic. Computational results are presented to demonstrate and compare the efficiency of both approaches for real-sized instances.enhub location problemnetwork designIPmatheuristiclocal searchevolutionary algorithm658338journal article