| 报告题名: | Experiments on the Node, Edge, and Arc Routing Problem |
| 作者: | Hasle, Geir; Kloster, Oddvar; Smedsrud, Morten; Gaze, Kevin
|
| 出版年: | 2012
|
| 发表日期: | 2012
|
| 国家: | 挪威
|
| 语种: | 英语
|
| 英文摘要: | The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004 along with the first benchmark called CBMix. The NEARP generalizes the classical Capacitated Vehicle Routing Problem (CVRP), the Capacitated Arc Routing Problem (CARP), and the General Routing Problem. It is also denoted the Mixed Capacitated General Routing Problem (MCGRP). The NEARP removes the strict and unwarranted dichotomy that previously existed in the literature between arc routing and node routing. In real applications, there are many cases where the pure node or arc routing models are not adequate. In fundamentally node-based routing applications such as newspaper delivery and communal waste management that have typically been modeled as arc routing problems in the literature, the number of points is often so large that demand aggregation is necessary. Aggregation heuristics will normally give a NEARP instance, possibly with side constraints. Hence, the NEARP is a scientifically challenging problem with high industrial relevance. In this report we present experiments with Spider, SINTEF’s industrial VRP solver, on the three NEARP benchmarks that have been published so far: CBMix, BHW, and DI-NEARP. Bach, Hasle, and Wøhlk have developed a combinatorial lower bound for the NEARP and defined the two latter benchmarks. Here, we present an experimental study with Spider on the three existing NEARP benchmarks. Upper and lower bounds are given for all instances. Three of the BHW instances have been solved to optimality. SINTEF has developed a web page for NEARP results on http://www.sintef.no/NEARP . |
| URL: | https://brage.bibsys.no/xmlui/bitstream/handle/11250/2380409/SINTEF%2bA23265.pdf?sequence=3&isAllowed=y
|
| 资源类型: | 研究报告
|
| 标识符: | http://119.78.100.158/handle/2HF3EXSE/28635
|
| Appears in Collections: | 过去全球变化的重建
影响、适应和脆弱性
科学计划与规划
气候变化与战略
全球变化的国际研究计划
气候减缓与适应
气候变化事实与影响
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| SINTEF+A23265.pdf（536KB） | 研究报告 | -- | 开放获取 | | View
Download
|
|
| Recommended Citation: | |
Hasle, Geir,Kloster, Oddvar,Smedsrud, Morten,et al. Experiments on the Node, Edge, and Arc Routing Problem. 2012-01-01.
|
|
|