IDEAS home Printed from https://ideas.repec.org/a/sae/risrel/v237y2023i4p781-797.html
   My bibliography  Save this article

A two-stage UAV routing problem with time window considering rescheduling with random delivery reliability

Author

Listed:
  • Rui Yan
  • Haotong Tian
  • Kaiye Gao
  • Rui Peng
  • Bin Liu

Abstract

Reliability is an important metric for unmanned aerial vehicles (UAVs) to perform important, complex, and dangerous tasks. In addition, reliability influences the operational cost in UAVs routing. In order to reduce the operational cost of UAVs tasks, a method of routing strategy optimization is proposed from a view of mission reliability in this paper to address the limitations in routing scheduling. Different from previous studies on the UAVs routing optimization problem, this paper proposes a method that can reduce the operational costs of UAVs tasks based on the mission reliability. This method includes two stages: the pre-optimization stage and the rescheduling stage. In the pre-optimization stage, an optimal UAVs route solution is obtained for all the targets, while in the rescheduling stage, new UAVs are dispatched to the unvisited targets in the pre-optimization stage based on the new optimal UAVs route.

Suggested Citation

  • Rui Yan & Haotong Tian & Kaiye Gao & Rui Peng & Bin Liu, 2023. "A two-stage UAV routing problem with time window considering rescheduling with random delivery reliability," Journal of Risk and Reliability, , vol. 237(4), pages 781-797, August.
    • Handle: RePEc:sae:risrel:v:237:y:2023:i:4:p:781-797
    DOI: 10.1177/1748006X221105395
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1748006X221105395
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1748006X221105395?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
    ---><---

    References listed on IDEAS

    as
    1. Gao, Kaiye & Yan, Xiangbin & Liu, Xiang-dong & Peng, Rui, 2019. "Object defence of a single object with preventive strike of random effect," Reliability Engineering and System Safety, Elsevier, vol. 186(C), pages 209-219.
    2. Yang, Li & Ye, Zhi-sheng & Lee, Chi-Guhn & Yang, Su-fen & Peng, Rui, 2019. "A two-phase preventive maintenance policy considering imperfect repair and postponed replacement," European Journal of Operational Research, Elsevier, vol. 274(3), pages 966-977.
    3. Qiu, Qingan & Cui, Lirong, 2019. "Optimal mission abort policy for systems subject to random shocks based on virtual age process," Reliability Engineering and System Safety, Elsevier, vol. 189(C), pages 11-20.
    4. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    5. Stewart, William R. & Golden, Bruce L., 1983. "Stochastic vehicle routing: A comprehensive approach," European Journal of Operational Research, Elsevier, vol. 14(4), pages 371-385, December.
    6. Peng, Rui, 2018. "Joint routing and aborting optimization of cooperative unmanned aerial vehicles," Reliability Engineering and System Safety, Elsevier, vol. 177(C), pages 131-137.
    7. Wu, Di & Gong, Min & Peng, Rui & Yan, Xiangbin & Wu, Shaomin, 2020. "Optimal Product Substitution and Dual Sourcing Strategy considering Reliability of Production Lines," Reliability Engineering and System Safety, Elsevier, vol. 202(C).
    8. Wen-Huei Yang & Kamlesh Mathur & Ronald H. Ballou, 2000. "Stochastic Vehicle Routing Problem with Restocking," Transportation Science, INFORMS, vol. 34(1), pages 99-112, February.
    9. Moshe Dror & Gilbert Laporte & Pierre Trudeau, 1989. "Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks," Transportation Science, INFORMS, vol. 23(3), pages 166-176, August.
    10. Zhao, Xian & Fan, Yu & Qiu, Qingan & Chen, Ke, 2021. "Multi-criteria mission abort policy for systems subject to two-stage degradation process," European Journal of Operational Research, Elsevier, vol. 295(1), pages 233-245.
    11. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    12. Lau, Hoong Chuin & Sim, Melvyn & Teo, Kwong Meng, 2003. "Vehicle routing problem with time windows and a limited number of vehicles," European Journal of Operational Research, Elsevier, vol. 148(3), pages 559-569, August.
    13. Paessens, H., 1988. "The savings algorithm for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 34(3), pages 336-344, March.
    Full references (including those not matched with items on IDEAS)

    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. Ke Chen & Xian Zhao & Qingan Qiu, 2022. "Optimal Task Abort and Maintenance Policies Considering Time Redundancy," Mathematics, MDPI, vol. 10(9), pages 1-16, April.
    2. Alan L. Erera & Juan C. Morales & Martin Savelsbergh, 2010. "The Vehicle Routing Problem with Stochastic Demand and Duration Constraints," Transportation Science, INFORMS, vol. 44(4), pages 474-492, November.
    3. Zhang, Junlong & Lam, William H.K. & Chen, Bi Yu, 2016. "On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows," European Journal of Operational Research, Elsevier, vol. 249(1), pages 144-154.
    4. Zhu, Xiaoning & Zhu, Xiaoping & Yan, Rui & Peng, Rui, 2021. "Optimal routing, aborting and hitting strategies of UAVs executing hitting the targets considering the defense range of targets," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    5. Fang, Chen & Chen, Jianhui & Qiu, Daizhen, 2024. "Reliability modeling for balanced systems considering mission abort policies," Reliability Engineering and System Safety, Elsevier, vol. 243(C).
    6. Prasanna Balaprakash & Mauro Birattari & Thomas Stützle & Marco Dorigo, 2015. "Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers," Computational Optimization and Applications, Springer, vol. 61(2), pages 463-487, June.
    7. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    8. Chen, Lijian & Chiang, Wen-Chyuan & Russell, Robert & Chen, Jun & Sun, Dengfeng, 2018. "The probabilistic vehicle routing problem with service guarantees," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 149-164.
    9. Qiu, Qingan & Cui, Lirong, 2019. "Gamma process based optimal mission abort policy," Reliability Engineering and System Safety, Elsevier, vol. 190(C), pages 1-1.
    10. Justin C. Goodson & Barrett W. Thomas & Jeffrey W. Ohlmann, 2016. "Restocking-Based Rollout Policies for the Vehicle Routing Problem with Stochastic Demand and Duration Limits," Transportation Science, INFORMS, vol. 50(2), pages 591-607, May.
    11. Levitin, Gregory & Xing, Liudong & Dai, Yuanshun, 2021. "Dynamic task distribution balancing primary mission work and damage reduction work in parallel systems exposed to shocks," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    12. Reusken, Meike & Laporte, Gilbert & Rohmer, Sonja U.K. & Cruijssen, Frans, 2024. "Vehicle routing with stochastic demand, service and waiting times — The case of food bank collection problems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 111-127.
    13. Alexandre M. Florio & Richard F. Hartl & Stefan Minner & Juan-José Salazar-González, 2021. "A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints," Transportation Science, INFORMS, vol. 55(1), pages 122-138, 1-2.
    14. E. Angelelli & R. Mansini & M. Vindigni, 2016. "The Stochastic and Dynamic Traveling Purchaser Problem," Transportation Science, INFORMS, vol. 50(2), pages 642-658, May.
    15. Florio, Alexandre M. & Hartl, Richard F. & Minner, Stefan, 2020. "Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 285(1), pages 172-182.
    16. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    17. Bertazzi, Luca & Secomandi, Nicola, 2018. "Faster rollout search for the vehicle routing problem with stochastic demands and restocking," European Journal of Operational Research, Elsevier, vol. 270(2), pages 487-497.
    18. Nicola Secomandi & François Margot, 2009. "Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 57(1), pages 214-230, February.
    19. Zhao, Xian & Sun, Jinglei & Qiu, Qingan & Chen, Ke, 2021. "Optimal inspection and mission abort policies for systems subject to degradation," European Journal of Operational Research, Elsevier, vol. 292(2), pages 610-621.
    20. Justin C. Goodson & Jeffrey W. Ohlmann & Barrett W. Thomas, 2013. "Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits," Operations Research, INFORMS, vol. 61(1), pages 138-154, February.

    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:sae:risrel:v:237:y:2023:i:4:p:781-797. 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: SAGE Publications (email available below). General contact details of provider: .

    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.