Using covering problems (CoP) combined with binary search is a well-known and successful solution approach for solving continuous center problems. In this paper, we show that this is also true for center hub location problems in networks. We introduce and compare various formulations for hub covering problems (HCoP) and analyse the feasibility polyhedron of the most promising one. Computational...

Abstract This paper presents a bi-objective model for the design and optimization of sustainable hierarchical multi-modal hub network. The proposed focuses on sustainability by considering economic, environmental, social aspects decisions in A case Turkish network freight transportation is used to validate model. To solve small-sized problems, augmented epsilon constraint method version 2 (AUGM...

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

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

The architecture of the network of protein-protein physical interactions in Saccharomyces cerevisiae is exposed through the combination of two complementary theoretical network measures, betweenness centrality and 'Q-modularity'. The yeast interactome is characterized by well-defined topological modules connected via a small number of inter-module protein interactions. Should such topological i...

Technical systems in the modern global world are rapidly evolving and improving. In most cases, these large-scale multi-level one of problems that arises design process such is to determine their reliability. Accordingly, paper, a mathematical model based on Weibull distribution has been developed for determining computer network order simplify calculating reliability characteristics, system co...

The Hub Labeling algorithm (HL) is an exact shortest path algorithm with excellent query performance on some classes of problems. It precomputes some auxiliary information (stored as a label) for each vertex, and its query performance depends only on the label size. While there are polynomial-time approximation algorithms to find labels of approximately optimal size, practical solutions use hie...

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and...

Hub facilities serve as switching and transshipment points in transportation and communication networks as well as in logistic systems. Hub networks have an influence on flows on the hub-to-hub links and ensure benefit from economies of scale in inter-hub transportation. The key factors for designing a successful hub-and-spoke network are to determine the optimal number of hubs, to properly loc...