Solving p-Hub Median Problem via Artificial Bee Colony Algorithm Considering Different Search Strategies

The hub location problem deals with locating hub facilities and allocating non-hub nodes to hub. Hub location problem is classified as p-hub median problem, p-hub center problem, hub covering problem and hub location problem with fixed cost in the literature. In this paper, multiple allocation p-hub median problem type is discussed. Artificial bee colony algorithm is used to solve multiple allocation p-hub median problem. The artificial bee colony algorithm which is orginally developed for solving continuous optimization problems is adapted to handle the discrete structure of the hub location problem. Different search strategies are considered in order to obtain more efficient solutions. With individually coded approaches, the performances of the algorithm are tested and its effectiveness are demonstrated.