Scalable and efficient algorithms are needed to compute shortest paths between any pair of vertices in large social graphs. In this work, we propose a novel ROBE scheme to estimate the shortest distances. ROBE is based on a hub serving as the skeleton of the large graph. In order to stretch the hub into every corner in the network, we first choose representative nodes with highest degrees that ...

This paper presents a new method for optimizing the hub height of a wind turbine. In general, wind turbine energy production increases with the hub height, but so does the cost. Therefore, we must optimize the hub height. Here, we calculated the annual energy production using a wind probability function. This is a function of the hub height and the roughness, which is a surface characteristic. ...

We introduce a new methodology to characterize the role that a given node plays inside the community structure of a complex network. Our method relies on the ability of the links to reduce the number of steps between two nodes in the network, which is measured by the number of shortest paths crossing each link, and its impact on the node proximity. In this way, we use node closeness to quantify...

This paper considers the parcel hub scheduling problem (PHSP) with unequal batch size inbound trailers, which is a combinatorial optimization problem commonly found in a parcel consolidation terminal in the parcel delivery industry (PDI). The problem consists of processing a large number of inbound trailers at a much smaller number of unload docks. The parcels in the inbound trailers must be un...

The rapid growth of the intercity travel demand has resulted in enormous pressure on passenger transportation network a megaregion area. Optimally locating hubs and allocating demands to influence effectiveness network. This study develops hierarchical hub location model considering service availability hubs. A mixed integer linear programming formulation was developed minimize total cost opera...