期刊
TRANSPORTATION SCIENCE
卷 50, 期 2, 页码 750-761出版社
INFORMS
DOI: 10.1287/trsc.2015.0588
关键词
generalized rural postman problem; close-enough arc routing problem; branch-and-cut
资金
- Spanish Ministerio de Economia y Competitividad [MTM2012-36163-C06-02]
- Generalitat Valenciana [GVPROMETEO2013-049]
The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an arc routing problem with some interesting real-life applications, such as routing for meter reading. In this article we introduce two new formulations for this problem as well as various families of new valid inequalities that are used to design and implement a branch-and-cut algorithm. The computational results obtained on test bed instances from the literature show that this algorithm outperforms the existing exact methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据