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

In this work we address a capacitated hub problem arising from a Telecommunications application. In this problem we must choose the routes and the hubs to use in order to send a set of commodities from sources to destinations in a given capacitated network with a minimum cost. The capacities and costs of the arcs and hubs are given, and the graph connecting the hubs is not assumed to be complet...

The capacitated single assignment hub location problem with modular link capacities is a variant of the classical hub location problem in which the cost of using edges is not linear but stepwise, and the hubs are restricted in terms of transit capacity rather than in the incoming traffic. This problem was introduced by Yaman and Carello in [18] and treated by a branch-and-cut and a tabu search ...

the hub location decision is a long term investment and any changes in it take considerable time and money. in real situations, some parameters are uncertain hence, deterministic models cannot be more efficient. the ability of two-stage stochastic programming is to make a long-term decision by considering effects of it in short term decisions simultaneously. in the two-stage stochastic programm...

Through observations from real life hub networks, we introduce the multimodal hub location and hub network design problem. We approach the hub location problem from a network design perspective. In hub network design problem, we jointly consider transportation costs and travel times, which are studied separately in most hub location problems presented in the literature. We allow different trans...

This paper presents a branch–and–price algorithm for the Capacitated Hub Location Problem with Single Assignment, in which Lagrangean relaxation is used to obtain tight lower bounds of the Restricted Master Problem (RPM). It is shown how to solve the pricing problem for finding new columns to be added to the RMP, or for proving that the lower bound of the current RMP is valid. Also, a lower bou...

The hierarchical hub location problem is encountered three-level network that is applied in production-distribution system, education system, emergency medical services, telecommunication network, etc. This paper addresses the hierarchical hub covering problem with single assignment accounting for mandatory dispersion of central hubs restriction as a special case. This formulation with incorpor...

In this paper, a complete review of published researches about hierarchical facility location and hub network problems is presented. Hierarchical network is a system where facilities with different service levels interact in a top-down way or vice versa. In Hierarchical systems, service levels are composed of different facilities. Published papers from (1970) to (2015) have been studied and a c...