Skip to main content

Advertisement

SpringerLink
Log in

Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems

  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigzag inequalities because they cut off fractional solutions containing a zigzag associated with variables with 0.5 value. Two different types of inequalities, the Odd Zigzag and the Even Zigzag inequalities, are presented. Finally, their application to other known Arc Routing Problems is discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Benavent, E., Carrotta, A., Corberán, A., Sanchis, J.M., Vigo, D.: Lower Bounds and Heuristics for the Windy Rural Postman Problem. Technical Report TR03-2003. Department of Statistics and OR, University of Valencia (Spain). Submitted to EJOR 2003

  2. Benavent, E., Corberán, A., Piñana, E., Plana, I., Sanchis, J.M.: New Heuristics for the Windy Rural Postman Problem. To appear in Comput. Oper. Res. 2005

  3. Chopra, S., Rinaldi, G.: The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities. SIAM J. Discrete Math. 9 (4), 602–624 (1996)

    Article  MathSciNet  Google Scholar 

  4. Christofides, N., Benavent, E., Campos, V., Corberán, A., Mota, E.: An Optimal Method for the Mixed Postman Problem. In: P. Thoft-Christensen (ed.) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, 59. Berlin: Springer-Verlag 1984

  5. Christofides, N., Campos, V., Corberán, A., Mota, E.: An Algorithm for the Rural Postman Problem. Report IC.OR. 81.5. Imperial College, London 1981

  6. Corberán, A., Mejía, G., Sanchis, J.M.: New Results on the Mixed General Routing Problem. To appear in Oper. Res. 2005

  7. Corberán, A., Mota, E., Sanchis, J.M.: A Comparison of Two Different Formulations for Arc Routing Problems on Mixed Graphs. To appear in Comput. Oper. Res. 2005

  8. Corberán, A., Plana, I., Sanchis, J.M.: On the Windy General Routing Polyhedron. In preparation 2005

  9. Corberán, A., Romero, A., Sanchis, J.M.: The Mixed General Routing Problem Polyhedron. Math. Programming 96, 103–137 (2003)

    Article  MATH  Google Scholar 

  10. Cornuèjols, G., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Math. Programming 33, 1–27 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  11. Eiselt, H.A., Gendreau, M., Laporte, G.: Arc-Routing Problems, Part 2: the Rural Postman Problem. Oper. Res. 43, 399–414 (1995)

    MATH  MathSciNet  Google Scholar 

  12. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton, NJ 1962

  13. Grötschel, M., Win, Z.: On the Windy Postman Polyhedron. Report No. 75, Schwerpunktprogram der Deutschen Forschungsgemeinschaft, Universität Augsburg, Germany 1988

  14. Grötschel, M., Win, Z.: A Cutting Plane Algorithm for the Windy Postman Problem. Math. Programming 55, 339–358 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  15. Guan, M.: On the Windy Postman Problem. Discrete Applied Mathematics 9, 41–46 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  16. Letchford, A.: New inequalities for the General Routing Problem. Eur. J. Oper. Res. 96, 317–322 (1997)

    Article  MATH  Google Scholar 

  17. Minieka, E.: The Chinese Postman Problem for Mixed Networks. Management Sci. 25, 643–648 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  18. Naddef, D., Rinaldi, G.: The Symmetric Traveling Salesman Polytope and its Graphical Relaxation: Composition of Valid Inequalities. Math. Programming 51, 359–400 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  19. Nobert, Y., Picard, J.C.: An Optimal Algorithm for the Mixed Chinese Postman Problem. Networks 27, 95–108 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  20. Ralphs, T.K.: On the Mixed Chinese Postman Problem. Oper. Res. Lett. 14, 123–127 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  21. Win, Z.: Contributions to Routing Problems. PhD Dissertation, University of Augsburg, Germany 1987

Download references

Author information

Authors and Affiliations

  1. Dept. d'Estadística i Investigació Operativa, Universitat de València, Spain

    Angel Corberán & Isaac Plana

  2. Dept. de Matemática Aplicada, Universidad Politécnica de Valencia, Spain

    José M. Sanchis

Authors
  1. Angel Corberán
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Isaac Plana
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José M. Sanchis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Angel Corberán.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Corberán, A., Plana, I. & Sanchis, J. Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems. Math. Program. 108, 79–96 (2006). https://doi.org/10.1007/s10107-005-0643-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-005-0643-y

Keywords

Search

Navigation