All the data files have been created using the following format.
J.M. Belenguer and E. Benavent (2003). A
Cutting Plane Algorithm for the Capacitated Arc Routing Problem.
Computers and Operations Research 30 (5), pp. 705-728.
E. Benavent, V. Campos, A. Corberán and E.
Mota (1992). The Capacitated Chinese Postman
Problem: Lower Bounds. Networks 22 (7), pp. 669-690.
B.L. Golden, J.S. DeArmon and E.K. Baker (1983).
Experiments with Algorithms for a Class of Routing Problems. Computers
and Operations Research 10 (1), pp. 47-59.
M. Kiuchi, Y. Shinano, R. Hirabayashi and Y. Saruwatari
(1995). An exact algorithm for the Capacitated Arc Routing Problem using Parallel
Branch and Bound method. Abstracts of the 1995 Spring National Conference of the Oper. Res. Soc.
of Japan, pp. 28-29.
L.Y.O. Li (1992). Vehicle Routeing
for Winter Gritting. PH.
D. Thesis, Dept. of Management Science, Lancaster University.
L.Y.O. Li and R.W. Eglese (1996).
An Interactive Algorithm for Vehicle Routeing for
Winter-Gritting. Journal of the Operational
Research Society 47, pp. 217-228.