ISSN:
1436-4646
Keywords:
Minisum Locations
;
Location-Allocation
;
Network Location
;
Dynamic Location
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract In this paper, we consider multiperiod minisum location problems on networks in which demands can occur continuously on links according to a uniform probability density function. In addition, demands may change dynamically over time periods and at most one facility can be located per time period. Two types of networks are considered in conjunction with three behavioral strategies. The first type of network discussed is a chain graph. A myopic strategy and long-range strategy for locatingp-facilities are considered, as is a discounted present worth strategy for locating two facilities. Although these problems are generally nonconvex, effective methods are developed to readily identify all local and global minima. This analysis forms the basis for similar problems on tree graphs. In particular, we construct algorithms for the 3-facility myopic problem and the 2-facility long-range and discounted cost problems on a tree graph. Extensions and suggestions for further research on problems involving more general networks are provided.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01582049
