Genetic and hybrid shuffled frog leaping algorithms for solving a 2-stage model for a hub covering location network

A hub location problem appears in a variety of applications, such as airline systems, cargo delivery systems and telecommunication network design. In this paper, we consider a central mine and a number of hubs (e.g., factories) connected to a number of nodes (e.g., shops or customers) in a network. First we design the hub network, and then schedule the raw materials transportation from the central mine to hubs (i.e., factories). In this case, we consider only one transportation system regarded as single machine scheduling. Furthermore, we use this hub network to solve the scheduling model. In this paper, we study the single allocation hub covering problem with capacity constraints, known as capacitated single allocation hub covering location problem (CSAHCLP), and then present a mixed-integer programming (MIP) model. In addition, we propose an efficient genetic algorithm and a hybrid shuffled frog leaping algorithm to solve the first and second stages of our presented model, respectively. A number of test problems are solved by the forgoing algorithms and the related results are compared with those results obtained by the Lingo software.