This paper proposes a continuum approximation model framework to solve a dynamic facility location problem for a large-scale growing market. The objective is to determine the optimal facility location and deployment time that minimize the costs for facility construction and customer service. To overcome computational challenge, a continuous approximation model is developed to find the optimal f...

In the Nearest Neighbor problem (NN), the objects in the database that are nearer to a given query object than any other objects in the database have to be found. In the conceptually inverse problem, Reverse Nearest Neighbor problem (RNN), objects that have the query object as their nearest neighbor have to be found. Reverse Nearest Neighbors queries have emerged as an important class of querie...

A lot of Metaheuristics for solving dynamic combinatorial facility layout problems have been developed, but still require much computation time when the number of facilities or planning horizon is large. Dynamic facility layout should meet a dynamic change in both product mix and demand quantity of each product over a planning horizon by adjusting facility layout effectively under a given syste...

Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...

this paper presents a fault location technique for transmission lines with minimum current measurement. this algorithm investigates proper current ratios for fault location problem based on thevenin theory in faulty power networks and calculation of short circuit currents in each branch. these current ratios are extracted regarding lowest sensitivity on thevenin impedance variations of the netw...

The dynamic facility layout problem (DFLP) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasi...

In the incremental versions of Facility Location and k-Median, the demand points arrive one at a time and the algorithm must maintain a good solution by either adding each new demand to an existing cluster or placing it in a new singleton cluster. The algorithm can also merge some of the existing clusters at any point in time. We present the first incremental algorithm for Facility Location whi...

different decisions, including location decisions of companies which are operating in international dynamic environment are subject to significant uncertainty.so in this research an international facility location problem under uncertainty is considered and an integrated model for strategic and operational planning is presented. in strategic level countries are assessed according to internation...