.png){kind=icon}
返回
Reoptimizing the rural postman problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2012.12.010.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given an instance of the Rural Postman Problem (RPP) together with its optimal solution, we study the problem of finding a good feasible solution after a perturbation of the instance has occurred. We refer to this problem as the reoptimization of the RPP. We first consider the case where a new required edge is added. Second, we address the case where an edge (required or not) is removed. We show that the reoptimization problems are NP-hard. We consider a heuristic for the case where a new required edge is added which is a modification of the cheapest insertion algorithm for the traveling salesman problem and show that it has a worst-case ratio equal to 2. Moreover, we show that simple algorithms to remove an edge from an optimal RPP tour guarantee a tight ratio equal to 3/2. Computational tests are made to compare the performance of these algorithms with respect to the Frederickson algorithm running from scratch. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Reoptimization
Rural postman problem
Heuristic algorithms
Worst-case analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
2.3W
机构
引用论文
.png){kind=icon}
分享收藏OS-based sensor node platform and energy estimation model for health-care wireless sensor networks
OAAI
OAAI分享收藏Physicochemical and Sensory Properties of Cookies Produced from Wheat, Unripe Plantain and Germinated Fluted Pumpkin Seed Composite Flour小麦、未成熟香蕉和发芽葫芦籽复合粉制成的曲奇饼的理化与感官特性
OAAI
OAAI分享收藏
查看更多内容