Locating the two-median of a tree network with continuous link demands |
| |
| Authors: | M. L. Brandeau S. S. Chiu R. Batta |
| |
| Affiliation: | (1) Department of Industrial Engineering and Engineering Management, Stanford University, 94305 Stanford, California, USA;(2) Department of Engineering-Economic Systems, Stanford University, 94305 Stanford, California, USA;(3) Massachusetts Institute of Technology, 02139 Cambridge, Massachusetts, USA |
| |
| Abstract: | Typical formulations of thep-median problem on a network assume discrete nodal demands. However, for many problems, demands are better represented by continuous functions along the links, in addition to nodal demands. For such problems, optimal server locations need not occur at nodes, so that algorithms of the kind developed for the discrete demand case can not be used. In this paper we show how the 2-median of a tree network with continuous link demands can be found using an algorithm based on sequential location and allocation. We show that the algorithm will converge to a local minimum and then present a procedure for finding the global minimum solution. |
| |
| Keywords: | Facility location minisum location continuous link demands tree networks sequential location and allocation |
| 本文献已被 SpringerLink 等数据库收录！ |
|
