IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v257y2017i1p1-12.html
   My bibliography  Save this article

The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm

Author

Listed:
  • Colombi, Marco
  • Corberán, Ángel
  • Mansini, Renata
  • Plana, Isaac
  • Sanchis, José M.

Abstract

The Hierarchical Mixed Rural Postman Problem is defined on a mixed graph where arcs and edges that require a service are divided into clusters that have to be serviced in a hierarchical order. The problem generalizes the Mixed Rural Postman Problem and thus is NP-hard. In this paper, we provide a polyhedral analysis of the problem and propose a branch-and-cut algorithm for its solution based on the introduced classes of valid inequalities. Extensive computational experiments are reported on benchmark instances. The exact approach allows to find the optimal solutions in less than 1 hour for instances with up to 999 vertices, 2678 links, and five clusters.

Suggested Citation

  • Colombi, Marco & Corberán, Ángel & Mansini, Renata & Plana, Isaac & Sanchis, José M., 2017. "The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm," European Journal of Operational Research, Elsevier, vol. 257(1), pages 1-12.
    • Handle: RePEc:eee:ejores:v:257:y:2017:i:1:p:1-12
    DOI: 10.1016/j.ejor.2016.07.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171630563X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.07.026?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lawrence D. Bodin & Samuel J. Kursh, 1978. "A Computer-Assisted System for the Routing and Scheduling of Street Sweepers," Operations Research, INFORMS, vol. 26(4), pages 525-537, August.
    2. Nathalie Perrier & André Langevin & Ciro-Alberto Amaya, 2008. "Vehicle Routing for Urban Snow Plowing Operations," Transportation Science, INFORMS, vol. 42(1), pages 44-56, February.
    3. Letchford, A.N. & Eglese, R.W., 1998. "The rural postman problem with deadline classes," European Journal of Operational Research, Elsevier, vol. 105(3), pages 390-400, March.
    4. Cabral, Edgar Alberto & Gendreau, Michel & Ghiani, Gianpaolo & Laporte, Gilbert, 2004. "Solving the hierarchical Chinese postman problem as a rural postman problem," European Journal of Operational Research, Elsevier, vol. 155(1), pages 44-50, May.
    5. Korteweg, Peter & Volgenant, Ton, 2006. "On the Hierarchical Chinese Postman Problem with linear ordered classes," European Journal of Operational Research, Elsevier, vol. 169(1), pages 41-52, February.
    6. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pengxiang Pan & Junran Lichen & Jianping Li, 2024. "Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem," Journal of Global Optimization, Springer, vol. 90(4), pages 965-982, December.
    2. Xiaoguang Bao & Xinhao Ni, 2024. "Approximation algorithms for two clustered arc routing problems," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-12, July.
    3. Colombi, Marco & Corberán, Ángel & Mansini, Renata & Plana, Isaac & Sanchis, José M., 2017. "The directed profitable rural postman problem with incompatibility constraints," European Journal of Operational Research, Elsevier, vol. 261(2), pages 549-562.
    4. Jessica Rodríguez-Pereira & Gilbert Laporte, 2022. "The target visitation arc routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 60-76, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marco Colombi & Ángel Corberán & Renata Mansini & Isaac Plana & José M. Sanchis, 2017. "The Hierarchical Mixed Rural Postman Problem," Transportation Science, INFORMS, vol. 51(2), pages 755-770, May.
    2. Jessica Rodríguez-Pereira & Gilbert Laporte, 2022. "The target visitation arc routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 60-76, April.
    3. Korteweg, Peter & Volgenant, Ton, 2006. "On the Hierarchical Chinese Postman Problem with linear ordered classes," European Journal of Operational Research, Elsevier, vol. 169(1), pages 41-52, February.
    4. Xiaoguang Bao & Xinhao Ni, 2024. "Approximation algorithms for two clustered arc routing problems," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-12, July.
    5. Nossack, Jenny & Golden, Bruce & Pesch, Erwin & Zhang, Rui, 2017. "The windy rural postman problem with a time-dependent zigzag option," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1131-1142.
    6. Abdullah Rasul & Jaho Seo & Shuoyan Xu & Tae J. Kwon & Justin MacLean & Cody Brown, 2022. "Optimization of Snowplow Routes for Real-World Conditions," Sustainability, MDPI, vol. 14(20), pages 1-17, October.
    7. Merve Kayacı Çodur & Mustafa Yılmaz, 2020. "A time-dependent hierarchical Chinese postman problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 337-366, March.
    8. Sullivan, James L. & Dowds, Jonathan & Novak, David C. & Scott, Darren M. & Ragsdale, Cliff, 2019. "Development and application of an iterative heuristic for roadway snow and ice control," Transportation Research Part A: Policy and Practice, Elsevier, vol. 127(C), pages 18-31.
    9. Oliver Lum & Bruce Golden & Edward Wasil, 2018. "An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 361-370, May.
    10. Nathalie Perrier & André Langevin & Ciro-Alberto Amaya, 2008. "Vehicle Routing for Urban Snow Plowing Operations," Transportation Science, INFORMS, vol. 42(1), pages 44-56, February.
    11. Stevanovic Dalibor, 2016. "Common time variation of parameters in reduced-form macroeconomic models," Studies in Nonlinear Dynamics & Econometrics, De Gruyter, vol. 20(2), pages 159-183, April.
    12. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    13. A. Fadlelmawla & M. Al-Otaibi, 2005. "Analysis of the Water Resources Status in Kuwait," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 19(5), pages 555-570, October.
    14. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    15. Duan, Jinyun & Li, Chenwei & Xu, Yue & Wu, Chia-Huei, 2017. "Transformational leadership and employee voice behavior: a Pygmalion mechanism," LSE Research Online Documents on Economics 68035, London School of Economics and Political Science, LSE Library.
    16. Mammassis, Constantinos S. & Kostopoulos, Konstantinos C., 2019. "CEO goal orientations, environmental dynamism and organizational ambidexterity: An investigation in SMEs," European Management Journal, Elsevier, vol. 37(5), pages 577-588.
    17. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    18. Jugend, Daniel & da Silva, Sérgio Luis & Salgado, Manoel Henrique & Miguel, Paulo Augusto Cauchick, 2016. "Product portfolio management and performance: Evidence from a survey of innovative Brazilian companies," Journal of Business Research, Elsevier, vol. 69(11), pages 5095-5100.
    19. Ian Maitland & Mitsuhiro Umezu, 2006. "An Evaluation of Japan's Stakeholder Capitalism," Journal of Private Enterprise, The Association of Private Enterprise Education, vol. 22(Spring 20), pages 131-164.
    20. Craig Loschmann & Özge Bilgili & Melissa Siegel, 2019. "Considering the benefits of hosting refugees: evidence of refugee camps influencing local labour market activity and economic welfare in Rwanda," IZA Journal of Migration and Development, Springer;Forschungsinstitut zur Zukunft der Arbeit GmbH (IZA), vol. 9(1), pages 1-23, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:257:y:2017:i:1:p:1-12. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.