Skip to main content
SpringerLink
Log in

The Train Delivery Problem Revisited

  • Conference paper
Algorithms and Computation (ISAAC 2013)

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

Included in the following conference series:

  • 1512 Accesses

Abstract

In this paper, we study the train delivery problem which is a generalization of the bin packing problem, and is also equivalent to a one dimensional version of the vehicle routing problem with unsplittable demands. We give an APTAS for the general problem with time complexity \(O(n^{O(\epsilon^{-4})})\), which is better than the previous one \(O(n^{(\frac{1}{\epsilon})^{O(\frac{1}{\epsilon})}})\), where n is the number of input elements.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation algorithms. PWS Publishing Company (1997)

    Google Scholar 

  2. Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within 1 + ε in linear time. Combinatorica (1981)

    Google Scholar 

  3. Das, A., Mathieu, C., Mozes, S.: The Train Delivery Problem - Vehicle Routing Meets Bin Packing. In: Jansen, K., Solis-Oba, R. (eds.) WAOA 2010. LNCS, vol. 6534, pp. 94–105. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Murgolo, F.D.: An efficient approximation scheme for variable-sized bin packing. SIAM J. Comput. 16(1), 149–161 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. Garey, M.R., Johnson, D.S.: “strong” np-completeness results: Motivation, examples, and implications. J. ACM 25(3), 499–508 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  6. Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM J. Comput. 15(1), 222–230 (1986)

    Article  MATH  Google Scholar 

  7. Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: FOCS, pp. 312–320. IEEE Computer Society, Washington, DC (1982)

    Google Scholar 

  8. Kang, J., Park, S.: Algorithm for the variable sized bin packing problem. European Journal of Operational Research 147(2), 365–372 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Seiden, S.S., van Stee, R., Epstein, L.: New bounds for variable-sized online bin packing. SIAM Journal on Computing 32(2), 455–469 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Epstein, L., Levin, A.: An APTAS for Generalized Cost Variable-Sized Bin Packing. SIAM J. Comput. 38(1), 411–428 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processor: Using the dual approximation approach. SIAM Journal on Computing 17, 539–551 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  12. Haimovich, M., Rinnooy Kan, A.H.G., Stougie, L.: Analysis of heuristics for vehicle routing problems. In: Vehicle Routing: Methods and Studies. Management Sci. System, vol. 16, pp. 47–61. North Holland, Amsterdam, Elsevier Scinece B.V. This is a full in book entry (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Informatics, Kyoto University, Japan

    Jing Chen & Kazuo Iwama

  2. Software School, Dalian University of Technology, Japan

    He Guo & Xin Han

Authors
  1. Jing Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. He Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xin Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kazuo Iwama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Chinese University of Hong Kong, Shatin, 100084, Hong Kong, China

    Leizhen Cai

  2. Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Clear Water Bay, 100044, Hong Kong, China

    Siu-Wing Cheng

  3. Department of Computer Science, University of Hong Kong, Porfkulam, 100084, Hong Kong, China

    Tak-Wah Lam

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, J., Guo, H., Han, X., Iwama, K. (2013). The Train Delivery Problem Revisited. In: Cai, L., Cheng, SW., Lam, TW. (eds) Algorithms and Computation. ISAAC 2013. Lecture Notes in Computer Science, vol 8283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45030-3_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45030-3_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45029-7

  • Online ISBN: 978-3-642-45030-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation