New approaches to hub location problems in public transport planning

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

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:S. Gelareh, S. Nickel
URN (permanent link):urn:nbn:de:hbz:386-kluedo-15556
Serie (Series number):Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (133)
Document Type:Report
Language of publication:English
Year of Completion:2007
Year of Publication:2007
Publishing Institute:Fraunhofer-Institut für Techno- und Wirtschaftsmathematik
Tag:Integer programming ; decomposition ; heuristic; hub location ; transportation
Faculties / Organisational entities:Fraunhofer (ITWM)
DDC-Cassification:510 Mathematik

$Rev: 12793 $