Stochastic location-assignment on the unit interval
by Viswanath, Kannan, Ph.D., PURDUE UNIVERSITY, 2007, 127 pages; 3307407
 Abstract: This dissertation is composed of two self-contained essays on stochastic location-assignment on the unit interval. In a stochastic location-assignment model a given number of servers are positioned on the unit interval to serve demands with random locations. The total number of demands may not be known apriori, but will not exceed the number of servers. Two kinds of demand arrivals are considered: (i) sequential; (ii) simultaneous. Chapter 1 addresses demands that arrive sequentially. Upon arrival of each demand a server is assigned. The assignment cost for a server-demand pair is the distance between them. Once a server is assigned it is unavailable to serve any subsequent demand. The objective is to determine the server-locations which minimize the expected value of the total assignment cost. A necessary condition for optimality of servers-locations is derived, and the set of optimal servers-locations is characterized. For demands that are independent and uniformly distributed over the interval, the convexity of the objective function and the uniqueness of optimal server-locations are shown. Finally, some insights are derived, based on numerical results, on the spatial distribution of the optimal server-locations for specific instances. Chapter 2 addresses demands that arrive simultaneously. A server is assigned to each demand with no server assigned to more than one demand. The assignment cost for a server-demand pair is the distance between them. The objective is to locate the servers so as to minimize the expected value of the total assignment cost. A necessary condition for optimality of servers-locations is derived. Specific subclasses of the model are considered; for which the number of demands is known apriori. For number of demands equal to the number of servers, the optimal assignment policy has an explicit form, and the optimal server-locations are the medians of the order statistic of demands. For two demands whose locations are independent and uniformly distributed over the interval, the convexity of the objective function and the uniqueness of optimal server-locations are shown. Finally, some insights are derived, based on numerical results, on the spatial distribution of the optimal server-locations for specific instances.

 Adviser James E. Ward School PURDUE UNIVERSITY Source DAI/A 69-05, p. , Aug 2008 Source Type Dissertation Subjects Management; Operations research; Urban planning Publication Number 3307407
Access the complete dissertation:

» Find an electronic copy at your library.
 Use the link below to access a full citation record of this graduate work: http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3307407 If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.