The existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. Although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

The hub location–allocation problem under uncertainty is a real-world task arising in the areas such as public and freight transportation and telecommunication systems. In many applications, the demand is considered as inexact because of the forecasting inaccuracies or human’s unpredictability. This study addresses the robust uncapacitated multiple allocation hub location problem with a set of ...

We study stochastic uncapacitated hub location problems in which uncertainty is associated to demands and transportation costs. We show that the stochastic problems with uncertain demands or dependent transportation costs are equivalent to their associated deterministic expected value problem (EVP), in which random variables are replaced by their expectations. In the case of uncertain independe...

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

Transportation costs are a significant part of capital and operating costs of large open pit mines. Cost efficiency and high reliability of in pit crushing and conveying systems compared to conventional truck-shovel system makes it more appealing to be utilized in modern mining activities. In this paper the suitable location of an in pit crusher is investigated as a single hub location problem....

This paper deals with a hub location-routing problem (HLRP) which integrates the hub location problem (HLP) and the multi-hub vehicle routing problem (MH-VRP) in parcel delivery service. The HLRP is very difficult to be solved since it is composed of two NP-hard problems, the HLP and the MH-VRP. To solve these problems simultaneously we present a novel solution framework which divides the probl...

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...

In the context of distance oracles, a labeling algorithm computes vertex labels during preprocessing. An s, t query computes the corresponding distance using the labels of s and t only, without looking at the input graph. Hub labels is a class of labels that has been extensively studied. Performance of the hub label query depends on the label size. Hierarchical labels are a natural special kind...

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...