Determining the best location to be profitable for the facility’s lifetime is the important decision of public and private firms, so this is why discussion about dynamic location problems (DLPs) is a critical significance. This paper presented a comprehensive review from 1968 up to most recent on published researches about DLPs and classified them into two parts. First, mathematical models deve...

Recent facility location allocation problems are engaged with social, environmental and many other aspects, besides cost objectives.Obtaining a sustainable solution for such problems requires development of new mathematical modeling and optimization algorithms. In this paper, an uncapacitated dynamic facility location-network design problem with random budget constraints is considered. Social i...

Determination of facilities, such as factories or warehouses, location and availability conditions is one of the important and strategic decisions for an organization to make. Transportation costs that form a major part of goods price are dependent to this decision making. There are verity of methods have been presented to achieve the optimal locations of these facilities which are generally de...

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

Facility location decisions are a critical element in strategic planning for a wide range of private and public ®rms. The rami®cations of siting facilities are broadly based and long-lasting, impacting numerous operational and logistical decisions. High costs associated with property acquisition and facility construction make facility location or relocation projects long-term investments. To ma...

We consider a dynamic facility location model in which the objective is to find a planning horizon, x*, and a first period decision, XI*, such that XI* is a first period decision for at least one optimal policy for all problems with planning horizons equal to or longer than x*. In other words, we seek a planning horizon, "r*, such that conditions after x* do not influence the choice of the opti...

This paper describes a new multiobjective interactive memetic algorithm applied to dynamic location problems. The memetic algorithm integrates genetic procedures and local search. It is able to solve capacitated and uncapacitated multi-objective single or multi-level dynamic location problems. These problems are characterized by explicitly considering the possibility of a facility being open, c...