The biobjective single allocation star p-hub location problem

This paper addresses a biobjective version of the single allocation star p-hub location problem which has many applications in transportation and telecommunications network design. The first objective is the median objective trying to minimize the total transportation costs, whereas the second objective is the center objective which aims at minimizing the maximum distance between origin-destination pairs. A mathematical formulation is proposed for the problem and the two objectives are aggregated using the weighting method. The proposed mathematical model is then solved using a standard optimization package and the computational results are discussed. The conducted numerical experiments show that the proposed mathematical model is efficient enough to obtain the optimal solutions in reasonable time.

Keywords:

star hub location problem , multi-objective optimization , p-hub median , p-hub center , mathematical programming