.png){kind=icon}
返回
A deterministic tabu search algorithm for the capacitated arc routing problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2006.07.007.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
heuristics
arc routing
tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏OS-based sensor node platform and energy estimation model for health-care wireless sensor networksOAAI
OAAI分享收藏Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees多中心电容弧路由问题: 使用电容树的禁忌搜索算法
PREAI
分享收藏
查看更多内容