Hub ports play an important role in reducing the number of container routes and saving operating costs liner companies. However, hub failures caused by uncertainties such as natural disasters may cause huge recovery costs. Considering accidental failure probability reallocation feeder ports, a global reliable shipping location problem (RLSHLP) is studied. We use k-means algorithm to divide netw...

Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to hubs in order to route the traffic between origin–destination pairs. In this paper we classify and survey network hub location models. We also include some recent trends on hu...

In this paper we present a 1.52-approximation algorithm for the metric uncapacitated facility location problem, and a 2-approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known approximation factor for the corresponding problem, and our soft-capacitated facility location algorithm achieves the inte...

in this paper, the capacitated location-routing problem with fuzzy demands (clrp-fd) is considered. the clrp-fd is composed of two well-known problems: facility location problem and vehicle routing problem. the problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. in clrp-fd, a set of c...

The hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin–destination pair. In the extensive literature on this challenging network design problem, it has widely been assumed that the subgraph induced by the hub nodes is complete. Relaxation of this basic assumption ...

Hub location problems, with the hub-and-spoke network structure, involve locating hub facilities, allocating the non-hubs (spokes) to the hubs, and determining the path for each origin-destination pair. In a pure hub-and-spoke network, all hubs, which act as intermediate switching or transshipment points for internodal flows, are fully interconnected and none of the non-hubs are directly connec...

The deployment of edge computing infrastructure requires a careful placement the servers, with an aim to improve application latencies and reduce data transfer load in opportunistic Internet Things systems. In server placement, it is important consider capacity, available budget, hardware requirements for servers underlying backbone network topology. this paper, we thoroughly survey existing li...