TY  - RPRT
A1  - Gelareh, S.
A1  - Nickel, S.
T1  - New approaches to hub location problems in public transport planning
N2  - In this paper, a new mixed integer mathematical programme is proposed for the application of Hub Location Problems (HLP) in public transport planning. This model is among the few existing ones for this application. Some classes of valid inequalities are proposed yielding a very tight model. To solve instances of this problem where existing standard solvers fail, two approaches are proposed. The first one is an exact accelerated Benders decomposition algorithm and the latter a greedy neighborhood search. The computational results substantiate the superiority of our solution approaches to existing standard MIP solvers like CPLEX, both in terms of computational time and problem instance size that can be solved. The greedy neighborhood search heuristic is shown to be extremely efficient.
T3  - Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) - 133 
KW  - Integer programming
KW  - hub location
KW  - transportation
KW  - decomposition
KW  - heuristic
Y1  - 2007
UR  - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1988
UR  - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-15556
ER  -