MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Optimal Location of Discretionary Service Facilities

Author(s)
Berman, Oded; Fouska, Nikoletta; Larson, Richard C.
Thumbnail
DownloadOR-231-90.pdf (1.409Mb)
Metadata
Show full item record
Abstract
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.
Date issued
1990-11
URI
http://hdl.handle.net/1721.1/5206
Department
Massachusetts Institute of Technology. Operations Research Center
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 231-90

Collections
  • Graduate Theses
  • Operations Research Center Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.