A comparison of two different formulations for Arc Routing Problems on Mixed graphs

[EN] Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented.Authors want to thank two anonymous referees for their careful reading of the manuscript. Also we thank the support given by the Ministerio de Ciencia y Tecnología of Spain through Grant TIC2003-05982-C05-01 and by the Generalitat Valenciana (Grupos 03/189).Corberán, A.; Mota, E.; Sanchís Llopis, JM. (2006). A comparison of two different formulations for Arc Routing Problems on Mixed graphs. Computers & Operations Research. 33(12):3384-3402. https://doi.org/10.1016/j.cor.2005.02.010S33843402331