Bi-objective p-hub Location Problems

Abstract

In this thesis, we introduce, model, and solve bi-objective hub location problems. The two well-known hub location problems from the literature, the p-hub median and p-hub center problems, are uni ed under a bi-objective setting considering the single, multiple, and r-allocation strategies. We developed a 3-index and a 4-index mixed-integer programming formulation for each of the allocation strategies. All the formulations are tested on the CAB dataset from the literature using a commercial optimization software. We observe the effect of different priorities given to the objectives on the locations of hub nodes, allocations, and the CPU time requirements with different allocation strategies under different values of problem parameters.