Experiments on the Node, Edge, and Arc Routing Problem

GSTDTAP > 气候变化

	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	查看原文
来源平台	Center for International Climate and Environmental Research-Oslo (CICERO)
文献类型	科技报告
条目标识符	http://119.78.100.173/C666/handle/2XK7JSWQ/1727
专题	气候变化
推荐引用方式 GB/T 7714	Hasle, Geir,Kloster, Oddvar,Smedsrud, Morten,et al. Experiments on the Node, Edge, and Arc Routing Problem,2012.