IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v38y2019i1d10.1007_s10878-019-00378-1.html
   My bibliography  Save this article

On the randomized online strategies for the k-Canadian traveler problem

Author

Listed:
  • Davood Shiri

    (Koc University)

  • F. Sibel Salman

    (Koc University)

Abstract

We consider the online k-Canadian Traveler Problem (k-CTP) which is defined on an undirected graph with a given source node O and a destination node D. Non-negative edge costs are given. The traveling agent is initially at O. There are k blocked edges in the graph, but these edges are not known to the agent. A blocked edge is learned when the agent arrives at one of its end-nodes. The goal of the agent is to arrive at D with minimum total cost. We consider the k-CTP on graphs that consist of only node-disjoint O–D paths, where it was shown that there is no randomized online strategy with competitive ratio better than $$k+1$$ k + 1 . An optimal randomized online strategy was also given. However, we prove that the given strategy cannot be implemented in some cases. We also modify the given strategy such that it can be implemented in all cases and meets the lower bound of $$k+1$$ k + 1 .

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:38:y:2019:i:1:d:10.1007_s10878-019-00378-1
    DOI: 10.1007/s10878-019-00378-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00378-1
    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-019-00378-1?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. 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.
    2. Chung-Shou Liao & Yamming Huang, 2015. "Generalized Canadian traveller problems," Journal of Combinatorial Optimization, Springer, vol. 29(4), pages 701-712, May.
    3. Huili Zhang & Yinfeng Xu & Lan Qin, 2013. "The k-Canadian Travelers Problem with communication," Journal of Combinatorial Optimization, Springer, vol. 26(2), pages 251-265, August.
    4. 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.
    5. 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.
    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. 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.
    2. Davood Shiri & Vahid Akbari, 2021. "Online Failure Diagnosis in Interdependent Networks," SN Operations Research Forum, Springer, vol. 2(1), pages 1-14, March.
    3. 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.
    4. 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.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    6. 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.
    7. 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.
    8. Yinfeng Xu & Huili Zhang, 2015. "How much the grid network and rescuers’ communication can improve the rescue efficiency in worst-case analysis," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1062-1076, November.
    9. 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.
    10. Davood Shiri & Vahid Akbari, 2021. "Online Failure Diagnosis in Interdependent Networks," SN Operations Research Forum, Springer, vol. 2(1), pages 1-14, March.
    11. Azadeh Tabatabaei & Mohammad Ghodsi, 2015. "Walking in streets with minimal sensing," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 387-401, August.
    12. Chung-Shou Liao & Yamming Huang, 2015. "Generalized Canadian traveller problems," Journal of Combinatorial Optimization, Springer, vol. 29(4), pages 701-712, May.
    13. Vural Aksakalli & Ibrahim Ari, 2014. "Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 370-384, May.
    14. Pierre Bergé & Jean Desmarchelier & Wen Guo & Aurélie Lefebvre & Arpad Rimmel & Joanna Tomasik, 2019. "Multiple Canadians on the road: minimizing the distance competitive ratio," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1086-1100, November.
    15. Sahin, Halenur & Kara, Bahar Yetis & Karasan, Oya Ekin, 2016. "Debris removal during disaster response: A case for Turkey," Socio-Economic Planning Sciences, Elsevier, vol. 53(C), pages 49-59.
    16. Lan Qin & Yinfeng Xu, 2017. "Fibonacci helps to evacuate from a convex region in a grid network," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 398-413, August.
    17. 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.
    18. Huili Zhang & Yinfeng Xu & Lan Qin, 2013. "The k-Canadian Travelers Problem with communication," Journal of Combinatorial Optimization, Springer, vol. 26(2), pages 251-265, August.
    19. 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.
    20. Vural Aksakalli & O. Furkan Sahin & Ibrahim Ari, 2016. "An AO* Based Exact Algorithm for the Canadian Traveler Problem," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 96-111, 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:spr:jcomop:v:38:y:2019:i:1:d:10.1007_s10878-019-00378-1. 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.