.png){kind=icon}
返回
Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00170-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the capacitated are routing problem with multiple centers (M-CARP) the objective is to find routes starting from the given depots or centers such that each required are is served, capacity (and usually additional) constraints are satisfied and total travel cost is minimized. In this paper we consider a heuristic transformation of the M-CARP into a multiple center capacitated minimum spanning tree problem with are constraints, that we call are-constrained CMST. An algorithm for determining initial feasible solutions as well as an improvement procedure for this problem are described and the re-translation of CMST solutions into the CARP context is explained. It is shown that the objective function value of the obtained CARP solution is easily derived from the respective value of the corresponding heuristic CMST solution. Furthermore, the possibility of including side constraints and the consideration of additional objective functions is discussed. Computations on real-world benchmark problems compare the results of the tabu search and simulated annealing metastrategies embedded in the improvement procedure. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
arc-routing
capacitated minimum spanning tree problem
tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Cross-talk between Rho and Rac GTPases drives deterministic exploration of cellular shape space and morphological heterogeneity.png)
Open Biology
OAAI
Open BiologyIF0
OAAI分享收藏分享收藏分享收藏
查看更多内容