Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5206Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Berman, Oded | - |
| dc.creator | Larson, Richard C., 1943- | - |
| dc.creator | Fouska, Nikoletta | - |
| dc.date | 2004-05-28T19:28:02Z | - |
| dc.date | 2004-05-28T19:28:02Z | - |
| dc.date | 1990-11 | - |
| dc.date.accessioned | 2013-10-09T02:38:25Z | - |
| dc.date.available | 2013-10-09T02:38:25Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5206 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Automatic teller machines and gasoline service stations are two examples of a growing number of "discretionary service facilities." In consuming service from these facilities, a significant fraction of customers do so on an otherwise preplanned trip (e.g., on the daily commute to and from work). A system planner, in determining the best locations of such facilities, is more concerned with placing the facilities along paths of customer flow rather than, say, near the center of a cluster of residences or work places. We formally model this problem and present a method for determining the optimal locations of m discretionary service facilities so as to intercept the maximum possible potential customer flow. We also show how to determine the minimal number of facilities required to intercept a prespecified fraction of total customer flow. Computational results are included. | - |
| dc.format | 1744 bytes | - |
| dc.format | 1478381 bytes | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | - |
| dc.relation | Operations Research Center Working Paper;OR 231-90 | - |
| dc.title | Optimal Location of Discretionary Service Facilities | - |
| dc.type | Working Paper | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.