A comparison of two different formulations for arc routing problems on mixed graphs |
| |
| Authors: | Angel Corbern Enrique Mota Jos M Sanchis |
| |
| Affiliation: | aDepartament d’Estadística i Investigació Operativa, Facultad de Matemáticas, Universitat de València, Dr. Moliner 50, 46100 Burjassot, Valencia, Spain;bDepartamento de Matemática Aplicada, Universidad Politécnica de Valencia, Spain |
| |
| Abstract: | 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. |
| |
| Keywords: | Arc routing Mixed Chinese postman problem Mixed rural postman problem Mixed general routing problem |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
