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


Vinícius 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.


Talk 2 of the contributed session Tue.2.H 0106
"Hub location problems" [...]
Cluster 13
"Logistics, traffic, and transportation" [...]


  payday loans direct . Since its introduction in the market buying Cialis can be exclusively in pharmacy chains with a prescription from a doctor. I agree that this is very inconvenient and takes a lot of time and effort.