Capacitated multiple-assignment p-hub center location problem

Abstract

This thesis considers a capacitated multiple-assignment p-hub center problem with fractional flow allowed. The problem is formulated as an MIP (Mixed Integer Programming), for which a solution algorithm is derived. The algorithm is based on the approach of covering problem combined with the binary search which is a well-known and successful approach for continuous center location problems. Moreover, valid inequalities are proposed to reduce the associated covering problem. Computational experiments on an Australian Post data set are conducted to evaluate the effectiveness of the proposed algorithm, and the results show that it performs well.