This paper addresses the problem of allocating high-voltage transformer spares throughout the electric grid to mitigate the risk of random transformer failures. With this application we investigate the use of approximate dynamic programming (ADP) for solving large scale stochastic facility location problems. The ADP algorithms that we develop consistently obtain near optimal solutions for probl...

This paper addresses the issue of defining a location service suitable for very dynamic and highly populated networks (millions of users), where services might experience highly correlated peaks of traffic or synchronized access to specific servers. Mobile agent technology is flexible enough to solve the major problems, allowing the dynamic deployment of new application servers when needed. But...

In this paper the damage location in beam like-structure is determined using static and dynamic data obtained using finite volume method. The change of static and dynamic displacement due to damage is used to establish an indicator for determining the damage location. In order to assess the robustness of the proposed method for structural damage detection, three test examples including a static...

Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...

in this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. let $t=(v,e)$ be a tree. the $(k,l)$-core of $t$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. we show that, when the sum of the weights of vertices is negative, t...

We present e cient algorithms for two problems of facility location. In both problems we want to determine the location of a single facility with respect to n given sites. In the rst we seek a location that maximizes a weighted distance function between the facility and the sites, and in the second we nd a location that minimizes the sum (or sum of the squares) of the distances of k of the site...

In hub-and-spoke systems, due to the changes in input parameters affecting system over time, transportation providers should make right and timely decisions about hub facilities. For this reason, multi-period location problems are especially important. This paper presents a comprehensive review of from 1990 up most recent published studies. First, we study developed models based on some charact...

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...