The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra

The windy postman problem consists of finding a minimum cost traversal of all of the edges of an undirected graph with two costs associated with each edge, representing the costs of traversing it in each direction. In this paper we deal with the windy general routing problem (WGRP), in which only a subset of edges must be traversed and a subset of vertices must be visited. This is also an ${\it NP}$-hard problem that generalizes many important arc routing problems (ARPs) and has some interesting real-life applications. Here we study the description of the WGRP polyhedron, for which some general properties and some large families of facet-inducing inequalities are presented. Moreover, since the WGRP contains many well-known routing problems as special cases, this paper also provides a global view of their associated polyhedra. Finally, for the first time, some polyhedral results for several ARPs defined on mixed graphs formulated by using two variables per edge are presented.

[1]  Á. Corberán,et al.  A polyhedral approach to the rural postman problem , 1994 .

[2]  Martin Grötschel,et al.  A cutting plane algorithm for the windy postman problem , 1992, Math. Program..

[3]  Gilbert Laporte,et al.  Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..

[4]  Ted K. Ralphs,et al.  On the mixed Chinese postman problem , 1993, Oper. Res. Lett..

[5]  B. Fleischmann.  A cutting plane procedure for the travelling salesman problem on road networks , 1985 .

[6]  Ángel Corberán,et al.  A branch & cut algorithm for the windy general routing problem and special cases , 2007, Networks.

[7]  Hediye Gun,et al.  Polyhedral structure and efficient algorithms for certain classes of the directed rural postman problem , 1993 .

[8]  Giovanni Rinaldi,et al.  The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities , 1991, Math. Program..

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

[10]  Gérard Cornuéjols,et al.  The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

[11]  Ángel Corberán,et al.  Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems , 2006, Math. Program..

[12]  M. Dror.  Arc Routing : Theory, Solutions and Applications , 2000 .

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

[14]  Meigu Guan,et al.  On the windy postman problem , 1984, Discret. Appl. Math..

[15]  Ángel Corberán,et al.  The mixed general routing polyhedron , 2003, Math. Program..

[16]  Ángel Corberán,et al.  The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra , 1998, Eur. J. Oper. Res..

[17]  Giovanni Rinaldi,et al.  The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities , 1996, SIAM J. Discret. Math..

[18]  Zaw Win,et al.  Contributions to routing problems , 1987 .

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

[20]  E. Minieka.  The Chinese Postman Problem for Mixed Networks , 1979 .

[21]  Michel Gendreau,et al.  Arc Routing Problems, Part II: The Rural Postman Problem , 1995, Oper. Res..

[22]  Ángel Corberán,et al.  An optimal method for the mixed postman problem , 1984 .

[23]  Ángel Corberán,et al.  New Results on the Mixed General Routing Problem , 2005, Oper. Res..

[24]  Adam N. Letchford.  New inequalities for the General Routing Problem , 1997 .

[25]  Ángel Corberán,et al.  A comparison of two different formulations for arc routing problems on mixed graphs , 2006, Comput. Oper. Res..

[26]  Yves Nobert,et al.  An optimal algorithm for the mixed Chinese postman problem , 1996, Networks.

[27]  Daniele Vigo,et al.  Lower bounds and heuristics for the Windy Rural Postman Problem , 2007, Eur. J. Oper. Res..