Skip to main content
SpringerLink
Log in

Finding Optimal Refueling Policies in Transportation Networks

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5034))

Included in the following conference series:

Abstract

We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total transportation costs between vertices. The insight into the structure of optimal refueling policies leads to an elegant reduction of the problem of finding optimal refueling policies into the classical shortest path problem, which ends in simple and more efficient algorithms for finding optimal refueling policies.

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. Atamtürk, A., Küçükyavuz, S.: Lot sizing with inventory bounds and fixed costs: polyhedral study and computation. Operations Research 53, 711–730 (2005)

    Article  MATH  Google Scholar 

  2. Corman, T.H., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    Google Scholar 

  3. Khuller, S., Malekian, A., Mestre, J.: To fill or not to fill: the gas station problem. In: Proceedings of European Symposia on Algorithms (2007)

    Google Scholar 

  4. Lin, S.-H., Gertsch, N., Russell, J.: A linear-time algorithm for finding optimal refueling policies. Operations Research Letters 35(3), 290–296 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Love, S.F.: Bounded production and inventory models with piecewise concave costs. Management Science 20, 313–318 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  6. Suzuki, Y.: A generic model for motor-carrier fuel optimization. Working paper, College of Business, Iowa State University

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Biola University, La Mirada, CA 90639, USA

    Shieu-Hong Lin

Authors
  1. Shieu-Hong Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rudolf Fleischer Jinhui Xu

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, SH. (2008). Finding Optimal Refueling Policies in Transportation Networks. In: Fleischer, R., Xu, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2008. Lecture Notes in Computer Science, vol 5034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68880-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68880-8_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68865-5

  • Online ISBN: 978-3-540-68880-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation