Skip to main content
SpringerLink
Log in

Better Approximation Ratios for the Single-Vehicle Scheduling Problems on Tree/Cycle Networks

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10627))

  • 887 Accesses

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. Networks 22, 263–282 (1992). https://doi.org/10.1002/net.3230220305

    Article  MATH  MathSciNet  Google Scholar 

  2. Psaraftis, H.N., Solomon, M.M., Magnanti, T.L., Kim, T.-U.: Routing and scheduling on a shoreline with release times. Manage. Sci. 36, 212–223 (1990). https://doi.org/10.1287/mnsc.36.2.212

    Article  MATH  Google Scholar 

  3. Karuno, Y., Nagamochi, H., Ibaraki, T.: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks 39(4), 203–209 (2002). https://doi.org/10.1002/net.10028

    Article  MATH  MathSciNet  Google Scholar 

  4. Gaur, D.R., Gupta, A., Krishnamurti, R.: A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times. Inform. Process. Lett. 86, 87–91 (2003). https://doi.org/10.1016/S0020-0190(02)00474-X

    Article  MATH  MathSciNet  Google Scholar 

  5. Bhattacharya, B., Carmi, P., Hu, Y., Shi, Q.: Single vehicle scheduling problems on Path/Tree/Cycle Networks with release and handling times. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 800–811. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-92182-0_70

    Chapter  Google Scholar 

  6. Yu, W., Liu, Z.: Single vehicle scheduling problems with release and service times on a line. Networks 57, 128–134 (2011). https://doi.org/10.1002/net.20393

    MATH  MathSciNet  Google Scholar 

  7. Karuno, Y., Nagamochi, H.: \(2\)-approximation algorithms for the multi-vehicle scheduling prbolem on a path with release and handling times. Discrete Appl. Math. 129, 433–447 (2003). https://doi.org/10.1016/S0166-218X(02)00596-6

    Article  MATH  MathSciNet  Google Scholar 

  8. Yu, W., Liu, Z.: Vehicle routing problems on a line-shaped network with release time constraints. Oper. Res. Lett. 37, 85–88 (2009). https://doi.org/10.1016/j.orl.2008.10.006

    Article  MATH  MathSciNet  Google Scholar 

  9. Karuno, Y., Nagamochi, H., Ibaraki, T.: Vehicle scheduling on a tree with release and handling times. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol. 762, pp. 486–495. Springer, Heidelberg (1993). https://doi.org/10.1007/3-540-57568-5_280

    Chapter  Google Scholar 

  10. Nagamochi, H., Mochizuki, K., Ibaraki, T.: Complexity of the single vehicle scheduling problem on graphs. Inform. Syst. Oper. Res. 35, 256–276 (1997). https://doi.org/10.1080/03155986.1997.11732334

    Article  MATH  Google Scholar 

  11. Bao, X., Liu, Z.: Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. Theoret. Comput. Sci. 434, 1–10 (2012). https://doi.org/10.1016/j.tcs.2012.01.046

    Article  MATH  MathSciNet  Google Scholar 

  12. Augustine, J.E., Seiden, S.S.: Linear time approximation schemes for vehicle scheduling problems. Theoret. Comput. Sci. 324, 147–160 (2004). https://doi.org/10.1016/j.tcs.2004.05.013

    Article  MATH  MathSciNet  Google Scholar 

  13. Bhattacharya, B., Hu, Y.: Approximation algorithms for the multi-vehicle scheduling problem. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6507, pp. 192–205. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17514-5_17

    Chapter  Google Scholar 

Download references

Acknowledgement

The authors would like to thank the associated editor and the anonymous referees for their constructive comments and kind suggestions. This research was supported by the National Natural Science Foundation of China under Grant No. 11371137.

Author information

Authors and Affiliations

  1. East China University of Science and Technology, Shanghai, China

    Yuanxiao Wu & Xiwen Lu

Authors
  1. Yuanxiao Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiwen Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiwen Lu .

Editor information

Editors and Affiliations

  1. Shanghai Jiao Tong University, Shanghai, China

    Xiaofeng Gao

  2. Harbin Institute of Technology, Shenzhen, China

    Hongwei Du

  3. Kennesaw State University, Kennesaw, Georgia, USA

    Meng Han

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wu, Y., Lu, X. (2017). Better Approximation Ratios for the Single-Vehicle Scheduling Problems on Tree/Cycle Networks. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10627. Springer, Cham. https://doi.org/10.1007/978-3-319-71150-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71150-8_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71149-2

  • Online ISBN: 978-3-319-71150-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation