期刊
COMPUTERS & OPERATIONS RESEARCH
卷 36, 期 1, 页码 135-148出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2007.08.004
关键词
Location; Obnoxious; Planar network; Hazard transport
In this paper we investigate the location of a facility anywhere inside a planar network. Two equivalent problems are analyzed. In one problem it is assumed that the links of the network create a nuisance or hazard and the objective is to locate a facility where the total nuisance is minimized. An equivalent problem is locating an obnoxious facility where the total nuisance generated by the facility and inflicted on the links of the network is minimized. Exact and approximate solution methods for its solution are proposed and tested on a set of planar networks with up to 40,000 links yielding good results. (C) 2007 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据