### Abstract

Discusses some of the implications of the randomness in networks, particularly with regard to locating facilities that minimize expected travel costs. The stochastic counterparts of the well- known 'uncapacitated warehouse location' and the 'm-median' problems in deterministic networks are presented, as well as some generalizations such as the 'generalized m-median' problem and the problem of locating on Markovian networks. The major theoretical question explored is whether some set of node locations is optimal, such as in the deterministic case. Some computational methods to determine these locations are briefly discussed. -Author

Original language | English (US) |
---|---|

Pages (from-to) | 172-183 |

Number of pages | 12 |

Journal | Geographical Analysis |

Volume | 12 |

Issue number | 2 |

State | Published - 1980 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Geography, Planning and Development

### Cite this

*Geographical Analysis*,

*12*(2), 172-183.

**Locational decisions on stochastic networks.** / Mirchandani, Pitu.

Research output: Contribution to journal › Article

*Geographical Analysis*, vol. 12, no. 2, pp. 172-183.

}

TY - JOUR

T1 - Locational decisions on stochastic networks.

AU - Mirchandani, Pitu

PY - 1980

Y1 - 1980

N2 - Discusses some of the implications of the randomness in networks, particularly with regard to locating facilities that minimize expected travel costs. The stochastic counterparts of the well- known 'uncapacitated warehouse location' and the 'm-median' problems in deterministic networks are presented, as well as some generalizations such as the 'generalized m-median' problem and the problem of locating on Markovian networks. The major theoretical question explored is whether some set of node locations is optimal, such as in the deterministic case. Some computational methods to determine these locations are briefly discussed. -Author

AB - Discusses some of the implications of the randomness in networks, particularly with regard to locating facilities that minimize expected travel costs. The stochastic counterparts of the well- known 'uncapacitated warehouse location' and the 'm-median' problems in deterministic networks are presented, as well as some generalizations such as the 'generalized m-median' problem and the problem of locating on Markovian networks. The major theoretical question explored is whether some set of node locations is optimal, such as in the deterministic case. Some computational methods to determine these locations are briefly discussed. -Author

UR - http://www.scopus.com/inward/record.url?scp=0018916761&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0018916761&partnerID=8YFLogxK

M3 - Article

VL - 12

SP - 172

EP - 183

JO - Geographical Analysis

JF - Geographical Analysis

SN - 0016-7363

IS - 2

ER -