Matheuristics for optimizing the network in German wagonload traffic

Abstract

In 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.

Keywords

• 90-08
• 90B06
• 90B20
• 90B10
• 90C11
• 90C59