IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i2d10.1007_s10878-022-00876-9.html
   My bibliography  Save this article

Online routing and searching on graphs with blocked edges

Author

Listed:
  • Davood Shiri

    (University of Sheffield)

  • Hakan Tozan

    (Istanbul Medipol University)

Abstract

We study routing and searching decisions of a search-and-detection (SDT) team on a road network under online uncertainty setting. Given an undirected edge-weighted bounded graph, a static target is positioned at an unknown vertex among potential target vertices in the graph. A non-negative search cost is given on each of the potential target vertices. The target is detected once the SDT searches its corresponding vertex. There may be some non-recoverable online blockages in the graph, but the existence of blockages is unknown to the SDT initially. If a blockage exists in the graph, it is disclosed online once the SDT visits one of its end-vertices. The graph stays connected when the blockages are omitted from it. The SDT begins from a certain vertex and aims to identify a route without any blocked edges which detects the target with minimum total traveling and search cost. We analyze this problem from a competitive analysis perspective under two scenarios with and without blockages. For the scenario with blockages, we provide a tight lower bound on the competitive ratio of deterministic solutions, an optimal deterministic solution, a randomized solution with a bounded expected competitive ratio, together with lower and upper bounds on the expected competitive ratio of the optimal randomized solutions. For the scenario without blockages, we provide tight lower bounds as well as optimal deterministic and randomized solutions.

Suggested Citation

  • Davood Shiri & Hakan Tozan, 2022. "Online routing and searching on graphs with blocked edges," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1039-1059, September.
    • Handle: RePEc:spr:jcomop:v:44:y:2022:i:2:d:10.1007_s10878-022-00876-9
    DOI: 10.1007/s10878-022-00876-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-022-00876-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-022-00876-9?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. Patrick Jaillet & Michael R. Wagner, 2006. "Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios," Transportation Science, INFORMS, vol. 40(2), pages 200-210, May.
    2. Henan Liu & Huili Zhang & Yi Xu, 2021. "The m-Steiner Traveling Salesman Problem with online edge blockages," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 844-860, May.
    3. Huili Zhang & Yinfeng Xu, 2018. "Online covering salesman problem," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 941-954, April.
    4. Patrick Jaillet & Michael R. Wagner, 2008. "Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses," Operations Research, INFORMS, vol. 56(3), pages 745-757, June.
    5. Akbari, Vahid & Shiri, Davood, 2021. "Weighted online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 51-65.
    6. Marco Bender & Stephan Westphal, 2015. "An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths," Journal of Combinatorial Optimization, Springer, vol. 30(1), pages 87-96, July.
    7. Davood Shiri & F. Sibel Salman, 2019. "Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 848-865, April.
    8. Davood Shiri & Vahid Akbari & F. Sibel Salman, 2020. "Online routing and scheduling of search-and-rescue teams," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(3), pages 755-784, September.
    9. Yinfeng Xu & Maolin Hu & Bing Su & Binhai Zhu & Zhijun Zhu, 2009. "The canadian traveller problem and its competitive analysis," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 195-205, August.
    10. Zhang, Huili & Tong, Weitian & Xu, Yinfeng & Lin, Guohui, 2015. "The Steiner Traveling Salesman Problem with online edge blockages," European Journal of Operational Research, Elsevier, vol. 243(1), pages 30-40.
    11. Davood Shiri & F. Sibel Salman, 2019. "On the randomized online strategies for the k-Canadian traveler problem," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 254-267, July.
    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. Akbari, Vahid & Shiri, Davood, 2021. "Weighted online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 51-65.
    2. Akbari, Vahid & Shiri, Davood & Sibel Salman, F., 2021. "An online optimization approach to post-disaster road restoration," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 1-25.
    3. Davood Shiri & Vahid Akbari, 2021. "Online Failure Diagnosis in Interdependent Networks," SN Operations Research Forum, Springer, vol. 2(1), pages 1-14, March.
    4. Zhang, Huili & Tong, Weitian & Lin, Guohui & Xu, Yinfeng, 2019. "Online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 273(2), pages 418-429.
    5. Zhang, Huili & Tong, Weitian & Xu, Yinfeng & Lin, Guohui, 2015. "The Steiner Traveling Salesman Problem with online edge blockages," European Journal of Operational Research, Elsevier, vol. 243(1), pages 30-40.
    6. Davood Shiri & F. Sibel Salman, 2017. "On the online multi-agent O–D k-Canadian Traveler Problem," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 453-461, August.
    7. Tippong, Danuphon & Petrovic, Sanja & Akbari, Vahid, 2022. "A review of applications of operational research in healthcare coordination in disaster management," European Journal of Operational Research, Elsevier, vol. 301(1), pages 1-17.
    8. Melih Çelik & Özlem Ergun & Pınar Keskinocak, 2015. "The Post-Disaster Debris Clearance Problem Under Incomplete Information," Operations Research, INFORMS, vol. 63(1), pages 65-85, February.
    9. Henan Liu & Huili Zhang & Yi Xu, 2021. "The m-Steiner Traveling Salesman Problem with online edge blockages," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 844-860, May.
    10. Xingang Wen & Yinfeng Xu & Huili Zhang, 2015. "Online traveling salesman problem with deadlines and service flexibility," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 545-562, October.
    11. Davood Shiri & F. Sibel Salman, 2019. "On the randomized online strategies for the k-Canadian traveler problem," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 254-267, July.
    12. Cong Chen & Huili Zhang & Yinfeng Xu, 2022. "Online machine minimization with lookahead," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1149-1172, July.
    13. Wadi Khalid Anuar & Lai Soon Lee & Hsin-Vonn Seow & Stefan Pickl, 2021. "A Multi-Depot Vehicle Routing Problem with Stochastic Road Capacity and Reduced Two-Stage Stochastic Integer Linear Programming Models for Rollout Algorithm," Mathematics, MDPI, vol. 9(13), pages 1-44, July.
    14. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    15. Ananya Christman & William Forcier & Aayam Poudel, 2018. "From theory to practice: maximizing revenues for on-line dial-a-ride," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 512-529, February.
    16. Devansh Jalota & Dario Paccagnan & Maximilian Schiffer & Marco Pavone, 2023. "Online Routing Over Parallel Networks: Deterministic Limits and Data-driven Enhancements," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 560-577, May.
    17. Wen, Jian & Nassir, Neema & Zhao, Jinhua, 2019. "Value of demand information in autonomous mobility-on-demand systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 121(C), pages 346-359.
    18. Chung-Shou Liao & Yamming Huang, 2015. "Generalized Canadian traveller problems," Journal of Combinatorial Optimization, Springer, vol. 29(4), pages 701-712, May.
    19. Fan, Tijun & Pan, Qianlan & Pan, Fei & Zhou, Wei & Chen, Jingyi, 2020. "Intelligent logistics integration of internal and external transportation with separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    20. Fabian Dunke & Stefan Nickel, 2021. "Online optimization with gradual look-ahead," Operational Research, Springer, vol. 21(4), pages 2489-2523, 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:spr:jcomop:v:44:y:2022:i:2:d:10.1007_s10878-022-00876-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.