The hierarchical hub maximal covering problem with determinate cover radiuses

Hierarchical facility location problems with three levels deal with location of facilities in any level and assignment traffic to given routing. Hub covering problems covered the demand nodes, if they are within a particular radius of a facility that can supply their demand. This paper study the single allocation hierarchical hub maximal covering problem over complete network linking in the first level, that is consists of hub facilities known as central hubs and in the second and third levels are star networks linking the hubs to central hubs and the demand places to hubs or central hubs. The problem assigns every non-hub nodes and hubs to their top level facilities with predetermined cover radiuses, and minimizing the total cost. The cover radiuses computed with a heuristic method finally present a mixed integer programming model for this problem and test the performance of the problem on the CAB data.