In this paper, dynamic facility location and supply chain planning are studied through minimizing the costs of facility location, path selection and transportation of coal under demand uncertainty. The proposed model dynamically incorporates possible changes in transportation network, facility investment costs, operating cost and changes in facility location. In addition, the time variation and...

Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...

We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where the cost itself is a minimum between two costs, according to whether the facility is used or not. We therefore call this type of location problem a min-max-min geometric facility location problem. As a f...

The facility voting location problems arise from the application of criteria derived from the voting processes concerning the location of facilities. The multiple location problems are those location problems in which the alternative solutions are sets of points. This paper extends previous results and notions on single voting location problems to the location of a set of facility points. The a...

We present new approximation algorithms for several facility location problems. In each facility location problem that we study, there is a set of locations at which we may build a facility (such as a warehouse), where the cost of building at location i is fi; furthermore, there is a set of client locations (such as stores) that require to be serviced by a facility, and if a client at location ...

One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. For this aim, a multi-objective facility location allocation model is proposed. In this case, an integrated BDA and epsilon constraint method are proposed and it is shown that how P...

facility location-allocation models are used in a widespread variety of applications to determine the number of required facility along with the relevant allocation process. in this paper, a new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customer's locations and fuzzy customer’s demands under the hurwicz criterion is proposed. ...

in this paper, a facility location problem of distribution systems, as one of the important and strategic issues in supply chain management, has been studied in a three-level supply chain under a stochastic condition. for this purpose, a two-stage mathematic model has been proposed for the location-allocation problem of distribution systems with regard to backup facilities for disrupting wareho...

The location of facilities anywhere in an area in which several competing facilities already exist and serving the demand points has been brought to light in this work. Because of the great importance of health care systems in the health of the people, these systems have been studied in the present paper. Creation and maintenance of competitive advantage in health care systems requires optimizi...