Journal
TRANSPORTATION SCIENCE
Volume 35, Issue 4, Pages 425-434Publisher
INST OPERATIONS RESEARCH MANAGEMENT SCIENCES
DOI: 10.1287/trsc.35.4.425.10431
Keywords
-
Ask authors/readers for more resources
The undirected capacitated are routing problem (CARP) arises naturally in several applications where streets require maintenance, or customers located along road must be serviced. Basic algorithmic procedures have recently been developed for the design of heuristics in an arc routing context. This article reports on the use of these basic tools in a variable neighborhood descent algorithm for the solution of the undirected CARP.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available