论文信息 - New lower bound for the Capacitated Arc Routing Problem - 字舞流文

New lower bound for the Capacitated Arc Routing Problem

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.

[1] Wen Lea Pearn,et al. New lower bounds for the Capacitated Arc Routing Problem , 1988, Networks.

[2] Wen Lea Pearn,et al. Transforming arc routing into node routing problems , 1987, Comput. Oper. Res..

[3] Bruce L. Golden,et al. Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[4] Ryuichi Hirabayashi,et al. NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM , 1992 .

[5] B. Golden,et al. The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases , 1987 .

[6] Ángel Corberán,et al. The Capacitated Arc Routing Problem: Lower bounds , 1992, Networks.

[7] M. BelenguerJ.,et al. The Capacitated Arc Routing Problem , 1998 .

[8] Bruce L. Golden,et al. Capacitated arc routing problems , 1981, Networks.