A Hybirid Algorithm for Hub Location Problem in Multimodal Logistic Networks

In the real-world, cargos may be forced along their routes pass from more number of hubs that this fact in the distribution networks and postal networks are visible. In this case, the use of hierarchical hub location models to determine the optimal location of hubs and assigning the nodes to them seems to be necessary. On the other hand, one of the most important issues in the transportation networks, is timely delivery of goods and increase service levels to enhance customer satisfaction.For this purpose, a multi-modal transportation network has been designed. In this type of networks, it can be used from various transport modes road, rail, sea and air. In the multi-modal transport network, a mismatch between the rate of flow entrance to hubs with processing rates of hub sources as well as time diversity in different modes of transferring goods, causing queues at hubs. Therefore, in this study, it is paid to surveying effects of resource constraints and the diversification in different transport routes time under the requirements of service time by using the queue model GI /G/1. In this study, a new variable neighborhood search-simulated annealing is proposed to solve the problem. Then, several numerical examples and sensitivity analysis to validate the performance of the model and the proposed algorithm is investigated.