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

Recently studies in area of supply chain network (SCN) have focused on the disruption issues in distribution systems. Also this paper extends the previous literature by providing a new biobjective model for cost minimization of designing a three echelon SCN across normal and failure scenarios with considering multi capacity option for manufacturers and distribution centers. Moreover, in order t...

In this chapter, we present a procedure that seeks the global minimum for the capacitated Euclidean location-allocation problem which is defined as follows. Given the fixed location of m existing facilities or customers on a continuous plane and their associated demands, we wish to determine the location of n new facilities or sources with known capacities, and the allocation of its supply, in ...

Consider a graph G = (V,E). At the vertices of G there are consumers of some product and the possible places of its production. For each vertex i in V the demand volume b(i), the cost f(i) for opening a facility and the restriction a(i) on the facility’s capacity are given. For each edge e in E, there are given the cost of the transportation of the product unit ce and the maximum quantity qe of...

We consider cost sharing for a class of facility location games, where the strategy spaceof each player consists of the bases of a player-specific matroid defined on the set of re-sources. We assume that resources have nondecreasing load-dependent costs and player-specific delays. Our model includes the important special case of capacitated facility loca-tion problems, where...

In order to model capacitated location–allocation problem with fuzzy demands, three types of fuzzy programming models – fuzzy expected cost minimization model, fuzzy a-cost minimization model, and credibility maximization model – are proposed according to different decision criteria. For solving these models, some hybrid intelligent algorithms are also designed. Finally, several numerical exper...

Full terms and conditions of use:

We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single depot, and combinatorial inequalities. The ow cover, e ective capacity, and single depot inequalities form subfamilies of the general family of submodular inequalities. The separation problem based on the family of subm...

Primal-dual algorithms have played an integral role in recent developments in approximation algorithms, and yet there has been little work on these algorithms in the context of LP relaxations that have been strengthened by the addition of more sophisticated valid inequalities. We introduce primal-dual schema based on the LP relaxations devised by Carr, Fleischer, Leung & Phillips for the minimu...

A different approach to the capacitated single allocation hub location problem is presented. Instead of using capacity constraints to limit the amount of flow that can be received by the hubs, we introduce a second objective function to the model (besides the traditional cost minimizing function), that tries to minimize the time to process the flow entering the hubs. Two bi-criteria single allo...