A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...

We consider a network design problem that arises in the costoptimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem We refer to it as the Capacitated Con...

This paper deals with hub-and-spoke network design in the liner shipping sector. It introduces a capacitated directed cycle hub location and cargo routing problem under congestion. The involves four decisions: of ports; allocation non-hub ports to construction cyclic route at port level; between all origin-destination demand pairs network. objective is minimize cost which includes fixed opening...

The authors explore the role of hubs (people with an exceptionally large number of social ties) in diffusion and adoption. Using data on a large network with multiple adoptions, they identify two types of hubs—innovative and follower hubs. Contrary to recent arguments, hubs tend to adopt earlier in the diffusion process, even though they are not necessarily innovative. Although innovative hubs ...

This paper presents an artificial bee colony (ABC) algorithm adjusted for the capacitated vehicle routing problem. The vehicle routing problem is an NP-hard problem and capacitated vehicle routing problem variant (CVRP) is considered here. The artificial bee metaheuristic was successfully used mostly on continuous unconstrained and constrained problems. Here this algorithm has been implemented ...

in this paper, a hierarchical p-hub median problem is considered that all the nodes and arcs on the network have limited capacities. proposed model has three-level where the complete network at the top level consists of the central hubs. the second and third levels consist of hub and demand nodes respectively, which are connected through star networks. also, delivery time restriction is taken i...

We investigate the structural properties of hubs that enable them to interact with several partners in protein-protein interaction networks. We find that hubs have more observed and predicted disordered residues with fewer loops/coils, and more charged residues on the surface as compared to non-hubs. Smaller hubs have fewer disordered residues and more charged residues on the surface than large...

Nombre d’établissements éducatifs sont assimilables à des hubs sociaux (social hubs). Sur le marché de l’apprentissage, ils mettent massivement en œuvre activités hubbing social. Au-delà du réseautage et la communication, rivalisent d’initiatives destinées valoriser une image d’espace rencontre porteur sens d’institutionnalisation soi. Des biais d’optimisme comme illusions contrôle compétence a...

in this study, a hierarchical hub location problem by considering different modes of transportation and maximum allowed delay is investigated. this study is done on iran’s express postal service with 2 days maximum delay in delivery considering ground and airport hubs. the problem is of the type of location and single allocation for collection, transfer and distribution of the shipments. all th...

Capacitated network design is a crucial problem to telecommunications network planners. In this paper we consider the Multi-Level Capacitated Minimum Spanning Tree Problem (MLCMST), a generalization of the well-known Capacitated Minimum Spanning Tree Problem. We present a genetic algorithm, based on the notion of grouping, that is quite effective in solving large-scale problems to within 10% of...