Distribution network design as a strategic decision has long-term effect on tactical and operational supply chain management. In this research, a supply chain design problem based on a two level capacity location allocation problem (TLCLAP) is presented. A product must be transported from a set of seaport to meet stores demands, passing out by intermediate warehouses. The objective is to locate...

At the strategic level, closed-loop supply chain (CLSC) management involves long-term decisions regarding the location and capacity allocation of forward/reverse logistics facilities, the assignment of products to facilities, and the distribution of products between facilities and their end users or suppliers. Both demand and return handling must be taken into account, and the overall problem b...

9 Abstract In rapidly growing urban areas, it is deemed vital to expand (or contract) 10 an existing network of public facilities to meet anticipated changes in the level of 11 demand. We present a multi-period capacitated median model for school network 12 facility location planning that minimizes transportation costs, while functional costs 13 are subject to a budget constraint. The proposed ...

Facility location problems form an important class of integer programming problems, with applications in the telecommunication, distribution and transportation industries. In this paper we are concerned with a particular type of facility location problem in which there exist two echelons of facilities. Each facility in the second echelon has limited capacity and can be supplied by only one faci...

This paper presents a continuous facility location model with fuzzy methodology. The developments concern mainly to some drawbacks in the initial model which takes it far from being used in practice. A fuzzy modeling method is proposed to estimate the required functions in the initial model. Structure identification in the proposed fuzzy modeling method is carried out using subtractive clusteri...

In the Capacitated facility location (Cfl) problem we are given a set F of facilities and a set C of clients in a common metric space. Every facility has a hard capacity ui. Opening a facility i incurs a nonnegative cost fi, while assigning a client j to facility i incurs a nonnegative connection cost cij . The goal is to open a subset F ′ ⊆ F of the facilities and assign each client to an open...

The metric uncapacitated facility location problem (Ufl) enjoys a special stature in approximation algorithms as a testbed for various techniques, among which LP-based methods have been especially prominent and successful. Two generalizations of Ufl are capacitated facility location (Cfl) and lower-bounded facility location (Lbfl). In the former, every facility has a capacity which is the maxim...