Applications and Implementation A SEPARABLE PROGRAMMING APPROACH TO EXPECTED COVERAGE: AN APPLICATION TO AMBULANCE LOCATION
将最大预期覆盖选址问题用可分离规划重新建模，保证最优解且求解更快，并允许设定节点最低覆盖次数和同时考虑两种覆盖类型，对救护车选址问题实用。
ABSTRACT The maximum expected covering location problem (MEXCLP) is reformulated using a separable programming approach. The resulting formulation—nonlinear maximum expected covering location problem (NMEXCLP)—guarantees optimality and also solves more quickly than previous heuristic approaches. NMEXCLP allows two important extensions. First, minor formulation changes allow the specification of the minimum number of times each node is to be covered in order to satisfy expected coverage criteria. Second, coverage matrices can be constructed that consider two different types of coverage simultaneously. Both extensions are useful for ambulance location problems and are demonstrated in that setting.