期刊
COMPUTERS & OPERATIONS RESEARCH
卷 31, 期 10, 页码 1667-1680出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0305-0548(03)00114-X
关键词
shortest path problem; robust optimization; interval data
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a very simple concept, is described. Some practical improvements to the basic idea, which speed up the method, are also presented. Computational results corroborate the correctness of the conjecture on which the algorithm is based and the potential of the approach. In particular, our method is proven to be able to retrieve high-quality solutions very quickly on some families of networks. For this reason, it could alternatively be used as a fast heuristic method. (C) 2003 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据