Network design: selection and design of links and facility location
Network design: selection and design of links and facility location
复制标题
DOI：
10.1016/s0965-8564(02)00014-9
复制
发表时间：
2003-03-01
影响因子：
6.4
通讯作者：
Wesolowsky, GO
中科院分区：
文献类型：
--
作者：
Drezner, Z;Wesolowsky, GO
在本文中，我们介绍了新的网络设计问题。给出了一个潜在链接的网络。每条链路既可以按给定成本建造，也可以不按给定成本建造。此外，每个构建的链接可以构建为单向链接或双向链接。其目标是将总建筑和运输成本降至最低。考虑了两种不同的运输成本：(I)在任何一对节点之间产生通信量，并且运输成本是用户的总成本，以及(Ii)在每个节点处产生服务需求，并且设施将位于节点上以满足需求。在这种情况下，运输成本是从设施到每个节点再往返的总成本。关于节点之间的链路，我们将考虑两种选择。它们既可以是双向的，也可以是混合的，同时允许双向和单向(在任一直接离子中)。当这些选项与两个目标函数相结合时，就产生了四个基本问题。这些问题通过下降算法、模拟退火法、禁忌搜索和遗传算法来解决。文中给出了大量的计算结果。(C)2002爱思唯尔科学有限公司。保留所有权利。
In this paper we introduce new network design problems. A network of potential links is given. Each link can be either constructed or not at a given cost. Also, each constructed link can be constructed either as a one-way or two-way link. The objective is to minimize the total construction and transportation costs. Two different transportation costs are considered: (i) traffic is generated between any pair of nodes and the transportation cost is the total cost for the users and (ii) demand for service is generated at each node and a facility is to be located on a node to satisfy the demand. The transportation cost in this case is the total cost for a round trip from the facility to each node and back. We will consider two options in regard to the links between nodes. They can either be two-way only, or mixed, with both two-way and one-way (in either direct ion) allowed. When these options are combined with the two objective functions, four basic problems are created. These problems are solved by a descent algorithm, simulated annealing, tabu search, and a genetic algorithm. Extensive computational results are presented. (C) 2002 Elsevier Science Ltd. All rights reserved.