IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i6p941-953.html
   My bibliography  Save this article

Disaggregated benders decomposition for solving a network maintenance scheduling problem

Author

Listed:
  • Robin H. Pearce
  • Michael Forbes

Abstract

We consider a problem concerning a network and a set of maintenance requests to be undertaken. The aim is to schedule the maintenance in such a way as to minimise the impact on the total throughput of the network. We embed disaggregated Benders decomposition in a branch-and-cut framework to solve the problem to optimality, as well as explore the strengths and weaknesses of the technique. We prove that our Benders cuts are Pareto-optimal. Solutions to the linear programming relaxation also provide further valid inequalities to reduce total solving time. We implement these techniques on simulated data presented in previous papers and compare our solution technique to previous methods and a direct mixed-integer programming formulation. We prove optimality in many problem instances that have not previously been proven.

Suggested Citation

  • Robin H. Pearce & Michael Forbes, 2019. "Disaggregated benders decomposition for solving a network maintenance scheduling problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(6), pages 941-953, June.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:6:p:941-953
    DOI: 10.1080/01605682.2018.1471374
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1471374
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1471374?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:70:y:2019:i:6:p:941-953. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.