Y. Khosravian - Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran
A. Shahandeh Nookabadi - Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran
G. Moslehi - Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran

The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure s parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In this paper, to deal with the periodic variations of parameters, a bi-objective mathematical model is proposed for the single allocation multi-period maximal hub covering problem. The ε-constraint approach has been applied to achieve non-dominated solutions. Given that the single-objective problem found in the ε-constraint method is computationally intractable. Benders decomposition algorithm by adding valid inequalities is developed to accelerate the solution process. Finally, the proposed method is carried out by CAB data set, and the results confirm the efficiency of it regarding optimality and running time.

maximal hub covering, dynamic hub location, multi-period hub location, ε-constraint method, Benders Decomposition