A dynamic Median Multiple Allocation hub Location Problem

Hub location problem is further used in transportation and telecommunication networks (airlines, post delivery services, etc.) so origin-destination pairs, receive or send commodities via special facilities called Hub. Hub median problem with multiple allocation is an NP-hard problem which includes both locating hub facilities and allocating non-hub nodes to hubs as minimizes total transportation and location costs. In this paper, the hub median problem is considered in an environment which network flow varies during the time periods and the capacities of hubs and arcs are unlimited. Also opening and closing hubs in different periods of planning horizon are permitted. The model and the proposed algorithm for this problem were considered to Iran airlines network using real passenger flows data. Computational results state that the dynamic network compared with static model has lower cost and whatever the number of time periods in dynamic case increases, the cost will be reduced as well