The Windy Clustered Prize-Collecting Arc-Routing Problem

This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed.

[1]  Elena Fernández,et al.  The Clustered Prize-Collecting Arc Routing Problem , 2009, Transp. Sci..

[2]  Ángel Corberán,et al.  The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra , 2008, SIAM J. Discret. Math..

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

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

[5]  Alain Hertz,et al.  The undirected capacitated arc routing problem with profits , 2010, Comput. Oper. Res..

[6]  Jan Karel Lenstra,et al.  On general routing problems , 1976, Networks.

[7]  Dan Gusfield,et al.  Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..

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

[9]  Michel Gendreau,et al.  The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm , 2005, Transp. Sci..

[10]  Cristina Zoltan,et al.  Privatized rural postman problems , 2006, Comput. Oper. Res..

[11]  José-Manuel Belenguer,et al.  The Capacitated Arc Routing Problem: Valid Inequalities and Facets , 1998, Comput. Optim. Appl..

[12]  Gilbert Laporte,et al.  Improvement Procedures for the Undirected Rural Postman Problem , 1999, INFORMS J. Comput..

[13]  Ángel Corberán,et al.  A cutting plane algorithm for the General Routing Problem , 2001, Math. Program..

[14]  Elena Fernández,et al.  Solving the Prize-collecting Rural Postman Problem , 2009, Eur. J. Oper. Res..

[15]  Ángel Corberán,et al.  Linear Programming Based Methods for Solving Arc Routing Problems , 2000 .

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

[17]  Martin Grötschel,et al.  A cutting plane algorithm for minimum perfect 2-matchings , 1987, Computing.

[18]  Dirk Oliver Theis,et al.  Odd minimum cut sets and b-matchings revisited , 2006, SIAM J. Discret. Math..

[19]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

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

[21]  Dino Ahr,et al.  Contributions to Multiple Postmen Problems , 2004 .