logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Arc routing in a node routing environment

delete2006-04-01
delete22
PRE
AI
J
Johan Oppen *
A
Arne Løkketangen
DOI：10.1016/j.cor.2004.09.004delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We describe a special variant of the vehicle routing problem (VRP), where there are many customers per road segment. This class of VRPs arises in, e.g. mail delivery, and is a borderline case where both arc routing and node routing techniques may be applied for modeling and solving. In a real-world setting, the problem should be modeled so as to incorporate all important constraining factors. We use a simplified node routing model and aggregate customers into supernodes to reduce problem size. A tabu search metaheuristic for the standard node routing-based VRP is then applied to the aggregated version of the problem. Our method is tested both on test instances from the literature as well as on a portfolio of new test instances especially made to fit the problem at hand. Experimental results are reported, showing that aggregation of customers can lead to substantial improvements both in solution time and solution quality in this setting, especially for larger instances. (c) 2004 Elsevier Ltd. All. rights reserved.
Keywords:
vehicle routing
VRP
tabu search
aggregation
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available