| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651756 | Electronic Notes in Discrete Mathematics | 2013 | 8 Pages |
Abstract
In this paper, we present a capacitated multiple allocation hub location problem, which arose from a network design problem in German wagonload traffic. We develop heuristic solution approaches based on local improvements. We solve the problem with the heuristics and CPLEX on test data sets provided by our partner Deutsche Bahn AG. The computational results are presented and compared.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
