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

A deterministic tabu search algorithm for the capacitated arc routing problem

delete2008-04-01
delete144
delete
OA
AI
J
José Brandão *
R
Richard Eglese
DOI：10.1016/j.cor.2006.07.007delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
The capacitated arc routing problem (CARP) is a difficult optimisation problem in vehicle routing with applications where a service must be provided by a set of vehicles on specified roads. A heuristic algorithm based on tabu search is proposed and tested on various sets of benchmark instances. The computational results show that the proposed algorithm produces high quality results within a reasonable computing time. Some new best solutions are reported for a set of test problems used in the literature. (C) 2006 Elsevier Ltd. All rights reserved.
Keywords:
heuristics
arc routing
tabu search
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