An Algorithm for SDIRP with Hard Time Windows

The Stochastic Demand Inventory Routing Problem (SDIRP) is a kind of typical NP-hard problem. Considering the coordination and optimization problem of inventory and distribution in the supply chain is the key to implementing vendor managed inventory (VMI) and is one of the most active directions in the OR realm. This paper studies the stochastic demand IRP with hard time windows (SDIRPHTW), and decomposes it into two sub-problems: stochastic inventory problem and routing schedule problem with time windows restriction. Then a heuristic algorithm based Markov Decision Process (MDP) and modified C-W algorithm is presented. Finally, the efficiency of the algorithm is analyzed through a numerical example.

• Record URL:
  • https://doi.org/10.1061/9780784412602.0074
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/isbn/9780784412602
• Supplemental Notes:
  • © 2012 American Society of Civil Engineers.
• Corporate Authors:

  American Society of Civil Engineers

  1801 Alexander Bell Drive
  Reston, VA  United States  20191-4400
• Authors:
  • Zhao, Da
  • Ma, Danxiang
  • Zeng, Yinlian
• Conference:
  • Inernational Conference of Logistics Engineering and Management 2012
  • Location: Chengdu , China
  • Date: 2012-10-8 to 2012-10-10
• Publication Date: 2012-11

Language

• English

Media Info

• Media Type: Web
• Pagination: pp 475-481
• Monograph Title: ICLEM 2012: Logistics for Sustained Economic Development—Technology and Management for Efficiency

Subject/Index Terms

• TRT Terms: Algorithms; Heuristic methods; Inventory; Markov processes; Optimization; Routing; Stochastic processes; Supply chain management; Time windows
• Uncontrolled Terms: Inventory routing problem
• Subject Areas: Freight Transportation; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01521814
• Record Type: Publication
• ISBN: 9780784412602
• Files: TRIS, ASCE
• Created Date: Apr 8 2014 12:20PM