New lower bound for the capacitated arc routing problem

被引：21

作者：

Wohlk, Sanne ^{[1
]}

机构：

[1] Univ So Denmark, Dept Management & Org, Odense, Denmark

来源：

COMPUTERS & OPERATIONS RESEARCH | 2006年 / 33卷 / 12期

关键词：

Capacitated Arc Routing Problem; lower bounds;

D O I：

10.1016/j.cor.2005.02.015

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We present a new lower bound, the Multiple Cuts Node Duplication Lower Bound, for the undirected Capacitated Arc Routing Problem. We prove that this new bound dominates the existing bounds for the problem. Computational results are also provided. (c) 2005 Elsevier Ltd. All rights reserved.

引用

页码：3458 / 3472

页数：15

共 7 条

[1]

Assad A. A., 1987, American Journal of Mathematical and Management Sciences, V7, P63

[2]

Assad A.A., 1987, COMPUTERS OPERATIONS, V14, P285

[3]

BAKER EK, 1983, COMPUTERS OPERATIONS, V10, P47

[4] THE CAPACITATED ARC ROUTING PROBLEM - LOWER BOUNDS [J].

BENAVENT, E ;

CAMPOS, V ;

CORBERAN, A ;

MOTA, E .

NETWORKS, 1992, 22 (07) :669-690

[5] CAPACITATED ARC ROUTING-PROBLEMS [J].

GOLDEN, BL ;

WONG, RT .

NETWORKS, 1981, 11 (03) :305-315

[6] NEW LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM [J].

PEARN, WL .

NETWORKS, 1988, 18 (03) :181-191

[7] NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM [J].

SARUWATARI, Y ;

HIRABAYASHI, R ;

NISHIDA, N .

JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1992, 35 (02) :119-133

← 1 →