A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
复制标题
混合多风电容弧路由问题的参数化近似算法:理论与实验
DOI:
10.1002/net.21742
复制
发表时间:
2017
期刊:
影响因子:
2.1
通讯作者:
und M. Sorge
中科院分区:
文献类型:
--
作者:
R. van Bevern;C. Komusiewicz;und M. Sorge
We prove that any polynomial‐time ‐approximation algorithm for then‐vertex metric asymmetric Traveling Salesperson Problem yields a polynomial‐time ‐approximation algorithm for the mixed and windy Capacitated Arc Routing Problem, where is the number of weakly connected components in the subgraph induced by the positive‐demand arcs—a small number in many applications. In conjunction with known results, we obtain constant‐factor approximations for and ‐approximations in general. Experiments show that our algorithm, together with several heuristic enhancements, outperforms many previous polynomial‐time heuristics. Finally, since the solution quality achievable in polynomial time appears to mainly depend onCand sinceC= 1 in almost all benchmark instances, we propose the Ob benchmark set, simulating cities that are divided into several components by a river. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 262–278 2017
登录
查看更多内容
影响因子:
2.1
作者:
K. Jansen
通讯作者:
K. Jansen
DOI:
10.1137/s0895480197331454
发表时间:
1999
期刊:
SIAM J. Discret. Math.
影响因子:
--
作者:
B. Raghavachari;J. Veerasamy
通讯作者:
J. Veerasamy
DOI:
10.1016/s0305-0548(99)00031-3
发表时间:
2000
期刊:
Comput. Oper. Res.
影响因子:
--
作者:
Á. Corberán;R. Martí;Antonio Romero
通讯作者:
Antonio Romero
DOI:
10.1007/978-3-642-25870-1_28
发表时间:
2011
期刊:
Oper. Res. Lett.
影响因子:
--
作者:
Manuel Sorge;René van Bevern;R. Niedermeier;Mathias Weller
通讯作者:
Mathias Weller
DOI:
10.1016/j.jcss.2016.06.001
发表时间:
2017
期刊:
J. Comput. Syst. Sci.
影响因子:
--
作者:
G. Gutin;Magnus Wahlström;Anders Yeo
通讯作者:
Anders Yeo