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

Online traveling salesman problem with time cost and non-zealous server

Author

Listed:
  • Tengyu Wu

    (Chongqing University of Posts and Telecommunications)

  • Lin He

    (Chongqing University of Posts and Telecommunications)

  • Haiyan Yu

    (Chongqing Jiaotong University)

Abstract

Considering that the time of meeting the demands is very important for emergency vehicle and emergency vehicle can’t reject any request, we introduce a more realistic cost form into online traveling salesman problem(OL-TSP). When a new request arrives, if the salesman can’t serve the request immediately, per-unit-time cost will be generated. The goal is to minimize server’s total costs(travel makespan plus the per-unit-time costs). We consider the server is a non-zealous server and show that neither deterministic nor randomized online algorithms can achieve constant competitive ratio for OL-TSP on general metric space. While on truncated line segment and uniform metric space, we prove lower bounds, and present competitive online algorithms. Especially for the case with uniform metric space, we prove an optimal Greedy algorithm.

Suggested Citation

  • Tengyu Wu & Lin He & Haiyan Yu, 2022. "Online traveling salesman problem with time cost and non-zealous server," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 2143-2166, October.
    • Handle: RePEc:spr:jcomop:v:44:y:2022:i:3:d:10.1007_s10878-020-00585-1
    DOI: 10.1007/s10878-020-00585-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00585-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-020-00585-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. Slotnick, Susan A. & Sobel, Matthew J., 2005. "Manufacturing lead-time rules: Customer retention versus tardiness costs," European Journal of Operational Research, Elsevier, vol. 163(3), pages 825-856, June.
    2. Zhou, Yawen & Liu, Jing & Zhang, Yutong & Gan, Xiaohui, 2017. "A multi-objective evolutionary algorithm for multi-period dynamic emergency resource scheduling problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 99(C), pages 77-95.
    3. Yu, Wei & Liu, Zhaohui & Bao, Xiaoguang, 2014. "Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 735-740.
    4. 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.
    5. Michiel Blom & Sven O. Krumke & Willem E. de Paepe & Leen Stougie, 2001. "The Online TSP Against Fair Adversaries," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 138-148, May.
    6. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    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. Tengyu Wu & Lin He & Haiyan Yu, 0. "Online traveling salesman problem with time cost and non-zealous server," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-24.
    2. Shiri, Davood & Akbari, Vahid & Hassanzadeh, Ali, 2024. "The Capacitated Team Orienteering Problem: An online optimization framework with predictions of unknown accuracy," Transportation Research Part B: Methodological, Elsevier, vol. 185(C).
    3. Mengyuan Gou & Haiyan Yu, 2023. "Online Delivery Problem for Hybrid Truck–Drone System with Independent and Truck-Carried Drones," Sustainability, MDPI, vol. 15(2), pages 1-15, January.
    4. Alarcón, F. & Alemany, M.M.E. & Ortiz, A., 2009. "Conceptual framework for the characterization of the order promising process in a collaborative selling network context," International Journal of Production Economics, Elsevier, vol. 120(1), pages 100-114, July.
    5. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    6. 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.
    7. Hu, Shaolong & Han, Chuanfeng & Dong, Zhijie Sasha & Meng, Lingpeng, 2019. "A multi-stage stochastic programming model for relief distribution considering the state of road network," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 64-87.
    8. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    9. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    10. Feifeng Zheng & E. Zhang & Yinfeng Xu & Wei-Chiang Hong, 2014. "Competitive analysis for make-to-order scheduling with reliable lead time quotation," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 182-198, January.
    11. Jeong, Ho Young & Yu, David J. & Min, Byung-Cheol & Lee, Seokcheon, 2020. "The humanitarian flying warehouse," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    12. George Steiner & Rui Zhang, 2011. "Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties," Operations Research, INFORMS, vol. 59(6), pages 1504-1511, December.
    13. Shi, Yong & Yang, Junhao & Han, Qian & Song, Hao & Guo, Haixiang, 2024. "Optimal decision-making of post-disaster emergency material scheduling based on helicopter–truck–drone collaboration," Omega, Elsevier, vol. 127(C).
    14. 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.
    15. Guo, Xin & Wu, Jianjun & Sun, Huijun & Yang, Xin & Jin, Jian Gang & Wang, David Z.W., 2020. "Scheduling synchronization in urban rail transit networks: Trade-offs between transfer passenger and last train operation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 138(C), pages 463-490.
    16. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    17. Chuck Holland & Jack Levis & Ranganath Nuggehalli & Bob Santilli & Jeff Winters, 2017. "UPS Optimizes Delivery Routes," Interfaces, INFORMS, vol. 47(1), pages 8-23, February.
    18. Feiyue Wang & Ziling Xie & Hui Liu & Zhongwei Pei & Dingli Liu, 2022. "Multiobjective Emergency Resource Allocation under the Natural Disaster Chain with Path Planning," IJERPH, MDPI, vol. 19(13), pages 1-19, June.
    19. 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.
    20. Qian, Jianbo & Steiner, George, 2013. "Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine," European Journal of Operational Research, Elsevier, vol. 225(3), pages 547-551.

    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:3:d:10.1007_s10878-020-00585-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.