The probabilistic gradual covering location problem on a network with discrete random demand weights英文电子书.pdf

Computers Operations Research 38 (2011) 1493–1500 Contents lists available at ScienceDirect Computers Operations Research journal homepage: /locate/caor The probabilistic gradual covering location problem on a network with discrete random demand weights Oded Berman a, Dmitry Krass a, Jiamin Wang b, a Joseph L. Rotman School of Management, University of Toronto, 105 St. George Street, Toronto, Ontario, Canada M5S 3E6 b College of Management, Long Island University, C. W. Post, 720 Northern Blvd, Brookville, NY 11548, United States of America a r t i c l e i n f o a b s t r a c t Available online 19 January 2011 We study the gradual covering location problem on a network with uncertain demand. A single facility Keywords: is to be located on the network. Two coverage radii are defined for each node. The demand originating Location from a node is considered fully covered if the shortest distance from the node to the facility does not Network exceed the smaller radius, and not covered at all if the shortest distance is beyond the larger radius. For Covering a distance between these two radii, the coverage level is specified by a coverage decay function. It is Probability assumed that demand weights are independent discrete random variables. The objective of the Optimization problem is to find a location for the facility so as to maximize the probability that the total covered