论文信息 - NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM

NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM

It is well-known that the tight lower bounds determine the effectiveness of the brancn and bound method for the NP-hard problems. In this paper, we present a new lower bounding procedure for the capacitated arc routing problem (CARP), one of the arc routing problems. They give the tight lower bounds and it is easy to develop an exact algorithm usinl~ their network structures.

Ryuichi Hirabayashi | Yasufumi Saruwatari | Naonori Nishida

[1] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[2] Ryuichi Hirabayashi,et al. Subtour Elimination Algorithm for the Capacitated Arc Routing Problem , 1992 .

[3] Bruce L. Golden,et al. VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

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

[5] Francisco Barahona,et al. Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem , 1990, Polyhedral Combinatorics.

[6] Gilbert Laporte,et al. An exact algorithm for the asymmetrical capacitated vehicle routing problem , 1986, Networks.

[7] Ángel Corberán,et al. An algorithm for the Rural Postman problem on a directed graph , 1986 .

[8] C. S. Orloff. A fundamental problem in vehicle routing , 1974, Networks.

[9] Moshe Dror,et al. Routing electric meter readers , 1979, Comput. Oper. Res..

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

[11] C. S. Orloff. On general routing problems: Comments , 1976, Networks.

[12] Moshe Dror,et al. Postman tour on a graph with precedence relation on arcs , 1987, Networks.

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