IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v61y2023i1p81-113.html
   My bibliography  Save this article

A two-stage stochastic programming model for collaborative asset protection routing problem enhanced with machine learning: a learning-based matheuristic algorithm

Author

Listed:
  • Erfaneh Nikzad
  • Mahdi Bashiri

Abstract

In this paper, a two-stage stochastic mathematical model is developed for an asset protection routing problem under a wildfire. The main aim of this study is to reduce the negative impact of a wildfire. Some parameters, such as travel and service times, obtaining profit by protecting an asset, and upper bounds of time windows, are considered as stochastic parameters. Generating proper scenarios for uncertain parameters has a large impact on the accuracy of the obtained solutions. Therefore, artificial neural networks are employed to extract possible scenarios according to previous actual wildfire events. The problem cannot be solved by exact solvers for large instances, so two matheuristic algorithms are proposed in this study to solve the problem in a reasonable time. In the first algorithm, a set of feasible routes is generated based on a heuristic approach, then a route-based mathematical model is used to obtain the final solution. Also, another matheuristic algorithm based on adaptive large neighbourhood search (ALNS) is proposed. In this algorithm, routing decisions are determined using the ALNS algorithm while other decisions are achieved by solving an intermediate mathematical model. The numerical analysis confirms the efficiency of both proposed algorithms; however, the first algorithm performs more efficiently.

Suggested Citation

  • Erfaneh Nikzad & Mahdi Bashiri, 2023. "A two-stage stochastic programming model for collaborative asset protection routing problem enhanced with machine learning: a learning-based matheuristic algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 61(1), pages 81-113, January.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:1:p:81-113
    DOI: 10.1080/00207543.2022.2113928
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2113928
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2022.2113928?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:tprsxx:v:61:y:2023:i:1:p:81-113. 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/TPRS20 .

    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.