The single allocation maximal hub covering problem: modeling and a tabu search heuristic

Hub location problem is one of the most important problems in the areas of logistics and telecommunication network design. In this paper weaddress the single allocation maximal covering hublocation problem in which the objective is to maximize the amount of covered flows associated with origin-destinationpairs in a hub-and-spoke network using a fixed number of hub facilities. A mathematical programming formulation is developed for the problem and since the problembelongs to the class of NP-hard problems, an efficient Tabu Search (TS) based heuristic is proposed to solve it.Computational results indicate the efficiency of the proposed heuristic both in terms of solution quality and CPU time.

کلیدواژه ها:

Logistics ، Hub location ، Maximal covering ، Tabu Search