Contributed Session Tue.2.H 0106

Tuesday, 13:15 - 14:45 h, Room: H 0106

Cluster 13: Logistics, traffic, and transportation [...]

Hub location problems


Chair: Julia Sender



Tuesday, 13:15 - 13:40 h, Room: H 0106, Talk 1

Julia Sender
A local improvement heuristic for a hub location problem in wagonload traffic

Coauthor: Uwe Clausen


In wagonload traffic, single wagons with different origins and destinations are consolidated on their routes through the railway network. The consolidation of wagons decreases the transportation costs but increases additional costs due to establishing and operating hub facilities. We present a specific capacitated multiple allocation hub location problem for the strategic network design of wagonload traffic developed together with our partner Deutsche Bahn AG. The model covers the main characteristics of wagonload traffic. Due to the difficulty to solve real-sized instances to (near-) optimality, we develop a new heuristic solution approach. The presented heuristic approach is based on local improvements (obtained, e. g, by relocation, opening, or closure of hub nodes or reallocation of non-hub nodes to hub nodes). We solve the problem with the heuristic approach and CPLEX on test data sets obtained from Deutsche Bahn. The computational results are presented and compared.



Tuesday, 13:45 - 14:10 h, Room: H 0106, Talk 2

Vinícius Amaral Armentano
Tabu search for the hub covering problem

Coauthor: Ana P. Milanez


Hub location is an important research area due to the use of hub networks in transportation and telecommunication systems that serve demand for goods or information between many origins and many destinations. Instead of serving every origin-destination demand with a direct link, hubs are used to switch and consolidate origin-destination flows, thus reducing the number of links in the network and allowing economies of scale to be exploited. As a consolidation point, flows from the same origin with different destinations are consolidated on their route to the hub and are combined with flows that have different origins but the same destination. We address the covering hub location problem which ensures that in hub networks goods between any origin and any destination are delivered within a given time limit, an important service constraint for less-than-truckload carriers. The objective is to minimize the number of hubs to be opened. Existing research on this problem has focused on the development of tighter integer programming models, which are solved by a solver. We propose a tabu search procedure for solving this problem, and the procedure is tested on instances from the literature.


  USA Payday Loans Online. In this section we give only a brief summary recommendation for admission of Levitra. Full information can be found in the instructions for receiving medications with vardenafil.