a bender’s decomposition algorithm for multi-objective hub location problem considering stochastic characteristics

in this paper, a multi-objective hub location problem considering stochastic links and candidate nodes characteristics is modeled. the first objective is to minimize total costs, including setup and transportation costs. the second one is to minimize network risks. characteristics such as weather conditions, safety, exchange rate, crisis, are defined as uncertainty parameters and considered as different scenarios. due to the size of the numbers of scenarios, it is assumed that the distribution of their risks is considered to be normal. also reliability levels associated to candidate hub nodes and links are considered as chance constraints. moreover a bender’s decomposition algorithm is utilized to solve the proposed model. in order to evaluate the performance of the proposed model, the results of this algorithm are compared to those of cplex solver. the comparison shows that cplex solver can solves small size problems but the bender’s decomposition algorithm is capable of solving problems of large scale as well as small ones.