In this paper we consider a capacitated single allocation p-hub median problem with multiple capacity levels (CSApHMPMC) in which the decisions are to determine the location of p hubs and their capacity levels, the single allocation of non-hub nodes to hubs in the logistics network. This problem is formulated as an integer programming model with the objective of minimizing the sum of total tran...

In contrast to p-hub problems with a summation objective (p-hub median), minmax hub problems (p-hub center) have not attained much attention in the literature. In this paper, we give a polyhedral analysis of the uncapacitated single allocation p-hub center problem (USApHCP). The analysis will be based on a radius formulation which currently yields the most efficient solution procedures. We show...

In this paper we propose several heuristics for the Uncapacitated -Allocation -Hub Median Problem. In the classical -hub problem, given a set of nodes with pairwise traffic demands, we must select of them as hub locations and route all traffics through them at a minimum cost. We target here an extension, called the -allocation -hub median problem, recently proposed by Yaman (2011), in which eve...

The present paper deals with a variant of hub location problems (HLP): the uncapacitated single allocation p-Hub median problem (USApHMP). This consists to jointly locate facilities and allocate demand nodes these selected facilities. objective function is minimize routing demands between any origin destination pair nodes. known be NP-hard. Based on artificial immune systems (AIS) framework, th...

The hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin–destination pair. In the extensive literature on this challenging network design problem, it has widely been assumed that the subgraph induced by the hub nodes is complete. Relaxation of this basic assumption ...