In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for set covering problem. particular, develop a new procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating computation of “surprisal” measure when selecting solution columns. Computational experiments, performed on instances OR-Library, showed that SBH yields 2.5% improve...

The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...

abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...