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

Improved algorithms for single vehicle scheduling on tree/cycle networks

Author

Listed:
  • Yuanxiao Wu

    (East China University of Science and Technology)

  • Xiwen Lu

    (East China University of Science and Technology)

Abstract

The single vehicle scheduling problems based on tree/cycle networks are studied in this paper. Each customer, assumed as a vertex on the given network, has a release time and a service time requirement. The single vehicle starts from the depot and aims to serve all the customers. The objective of the problem is to find the optimal routing schedule so as to minimize the makespan. We provide a $$\frac{16}{9}$$ 16 9 -approximation algorithm and a $$\frac{48}{25}$$ 48 25 -approximation algorithm for the tour-version and path-version of single vehicle scheduling problem on a tree, respectively. For the tour-version and path-version of single vehicle scheduling problem on a cycle, we present a $$\frac{5}{3}$$ 5 3 -approximation algorithm and a $$\frac{29}{17}$$ 29 17 -approximation algorithm, respectively.

Suggested Citation

  • Yuanxiao Wu & Xiwen Lu, 2021. "Improved algorithms for single vehicle scheduling on tree/cycle networks," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 565-580, October.
    • Handle: RePEc:spr:jcomop:v:42:y:2021:i:3:d:10.1007_s10878-019-00420-2
    DOI: 10.1007/s10878-019-00420-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00420-2
    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-00420-2?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. Yoshiyuki Karuno & Hiroshi Nagamochi & Toshihide Ibaraki, 1997. "Vehicle scheduling on a tree with release and handling times," Annals of Operations Research, Springer, vol. 69(0), pages 193-207, January.
    2. Harilaos N. Psaraftis & Marius M. Solomon & Thomas L. Magnanti & Tai-Up Kim, 1990. "Routing and Scheduling on a Shoreline with Release Times," Management Science, INFORMS, vol. 36(2), pages 212-223, 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. Yuanxiao Wu & Xiwen Lu, 0. "Improved algorithms for single vehicle scheduling on tree/cycle networks," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.
    2. Michael Hassoun & Shraga Shoval & Eran Simchon & Liron Yedidsion, 2020. "The single line moving target traveling salesman problem with release times," Annals of Operations Research, Springer, vol. 289(2), pages 449-458, June.
    3. 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.
    4. Herer, Yale T., 1999. "Submodularity and the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 114(3), pages 489-508, May.
    5. Sofie Coene & Frits C. R. Spieksma & Gerhard J. Woeginger, 2011. "Charlemagne's Challenge: The Periodic Latency Problem," Operations Research, INFORMS, vol. 59(3), pages 674-683, June.
    6. Hao Yan & Peihai Liu & Xiwen Lu, 2023. "Vehicle scheduling problems with two agents on a line," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-18, January.
    7. Bock, Stefan, 2015. "Solving the traveling repairman problem on a line with general processing times and deadlines," European Journal of Operational Research, Elsevier, vol. 244(3), pages 690-703.
    8. Nils Boysen & Dirk Briskorn & Stefan Schwerdfeger, 2023. "How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring," Journal of Scheduling, Springer, vol. 26(1), pages 19-41, February.
    9. Bock, Stefan, 2024. "Vehicle routing for connected service areas - a versatile approach covering single, hierarchical, and bi-criteria objectives," European Journal of Operational Research, Elsevier, vol. 313(3), pages 905-925.
    10. Averbakh, Igor & Berman, Oded & Chernykh, Ilya, 2006. "The routing open-shop problem on a network: Complexity and approximation," European Journal of Operational Research, Elsevier, vol. 173(2), pages 531-539, September.
    11. Wei Yu & Zhaohui Liu, 2014. "Vehicle routing problems with regular objective functions on a path," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 34-43, February.
    12. Bock, Stefan, 2020. "Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios," European Journal of Operational Research, Elsevier, vol. 283(3), pages 863-882.
    13. Nils Boysen & Dirk Briskorn & Simon Emde, 2018. "Scheduling electric vehicles and locating charging stations on a path," Journal of Scheduling, Springer, vol. 21(1), pages 111-126, February.
    14. Kim, Kap Hwan & Lee, Keung Mo & Hwang, Hark, 2003. "Sequencing delivery and receiving operations for yard cranes in port container terminals," International Journal of Production Economics, Elsevier, vol. 84(3), pages 283-292, June.
    15. Stefan Bock, 2016. "Finding optimal tour schedules on transportation paths under extended time window constraints," Journal of Scheduling, Springer, vol. 19(5), pages 527-546, October.
    16. Zenker, Michael & Emde, Simon & Boysen, Nils, 2016. "Cyclic inventory routing in a line-shaped network," European Journal of Operational Research, Elsevier, vol. 250(1), pages 164-178.
    17. Srour, F.J. & Zuidwijk, R.A., 2008. "How Much is Location Information Worth? A Competitive Analysis of the Online Traveling Salesman Problem with Two Disclosure Dates," ERIM Report Series Research in Management ERS-2008-075-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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:42:y:2021:i:3:d:10.1007_s10878-019-00420-2. 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.