Skip to main content
SpringerLink
Log in

Study of Stochastic Demand Inventory Routing Problem with Soft Time Windows Based on MDP

  • Chapter
Advances in Neural Network Research and Applications

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 67))

Abstract

Compared with related studies of stochastic demand inventory routing problem (IRP), this paper takes the constraints of soft time windows into consideration. Specially, penalties for violating time window limits are included in value function; upper limit of time window is dependent on inventory level. These assumptions of IRP are more practical. Firstly, the paper represents stochastic demand inventory routing problem with soft time windows (IRPSTW) as a discrete time Markov decision process model. Then the paper proposes a solution with considering constraints of soft time windows. Finally the application of this solution is illustrated with a numerical example.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Kleywegt, A.J., Nori, V.S., Savelsbergh, M.W.P.: Dynamic Programming Approximations for a Stochastic Inventory Routing Problem. Transportation Science 38(1), 42–70 (2004)

    Article  Google Scholar 

  2. Qu, W., James, H.B., Iyogun, P.: An Integrated Inventory Transportation System with Modified Periodic Policy for Multiple Products. European Journal of Operational Research 115(2), 254–269 (1999)

    Article  MATH  Google Scholar 

  3. Federgruen, A., Zipkin, P.: A Combined Vehicle Routing and Inventory Allocation Problem. Operations Research 32(5), 1019–1036 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  4. Golden, B., Assad, A., Dahl, R.: Analysis of a Large Scale Vehicle Routing Problem with an Inventory Component. Large Scale Systems 7(2), 181–190 (1984)

    MATH  Google Scholar 

  5. Jaillet, P., Bard, J.F., Huang, L., Dror, M.: Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework. Transportation Science 36(3), 292–300 (2002)

    Article  MATH  Google Scholar 

  6. Minkoff, A.S.: A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching. Operation Research 41, 77–90 (1993)

    Article  MATH  Google Scholar 

  7. Anily, S., Federgruen, A.: One Warehouse Multiple Retailer Systems with Vehicle Routing Costs. Management Science 36(1), 92–114 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Zhao, D., Li, J.: An algorithm for Stochastic Demand Inventory Routing Problem with Time Windows (in Chinese). Science Paper Online, http://www.paper.edu.cn

Download references

Author information

Authors and Affiliations

  1. Institute of Systems Engineering, Huazhong University of Science and Technology, Wuhan, Hubei, 430074, P.R. China

    Wei Zeng & Qian Zhao

Authors
  1. Wei Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qian Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Control Science and Engineering, Huazhong University of Science and Technology, 430074, Wuhan, Hubei, China

    Zhigang Zeng

  2. Department of Mechanical & Automation Engineering, The Chinese University of Hong Kong, Shatin, New Territories, Hong Kong

    Jun Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Zeng, W., Zhao, Q. (2010). Study of Stochastic Demand Inventory Routing Problem with Soft Time Windows Based on MDP. In: Zeng, Z., Wang, J. (eds) Advances in Neural Network Research and Applications. Lecture Notes in Electrical Engineering, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12990-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12990-2_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12989-6

  • Online ISBN: 978-3-642-12990-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation