This paper studies capacitated single-allocation hub covering location problem with fuzzy cover radius and travel time. Objective of hub covering problem is to find the minimum number of hubs considering the maximum allowable travel time. Computational results show that due to uncertainty, number of hubs and the allocation of non-hub nodes to hub nodes are changed. This paper proposes heuristic...

The need to make effective plans for locating transportation hubs is of increasing importance in the megaregional area, as recent research suggests that growing intercity travel demand affects efficiency a system. This paper investigates hierarchical facility location problem passenger network. aim study determine locations hub facilities at different levels and distribute demands these with mi...

A wide variety of real-life networks share two remarkable generic topological properties: scale-free behavior and modular organization, and it is natural and important to study how these two features affect the dynamical processes taking place on such networks. In this paper, we investigate a simple stochastic process--trapping problem, a random walk with a perfect trap fixed at a given locatio...

In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...

Transport networks with hub structure organise the exchange of shipments between many sources and sinks. All sources and sinks are connected to a small number of hubs which serve as transhipment points, so that only few, strongly consolidated transport relations exist. While hubs and detours lead to additional costs, the savings from bundling shipments, i.e. economies of scale, usually outweigh...