A Improved Subgradient Lagrangian Relaxation Algorithm for Solving the Stochastic Demand Inventory Routing Problem

Yuan-Yuan Zhao and Qian-qian Duan

Cyber-Physical Systems, 2023, vol. 9, issue 2, 174-192

Abstract: In order to improve the coordination efficiency of vehicle routing problem, a multi-level stochastic demand in ventory routing problem was established in this paper, which minimizes the total cost of the system by determining the relation among inventory of distribution center, fleets, and customer needs. Solving the Lagrangian dual problem by the traditional subgradient Lagrangian relaxation algorithm may easily cause oscillation and then slow down the solving speed. To tackle the problem, an improved subgradient Lagrangian relaxation algorithm was proposed. Compared with the traditional subgradient algorithm , the proposed method is faster and improves the quality of the approximate solution.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/23335777.2021.1946719 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tcybxx:v:9:y:2023:i:2:p:174-192

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tcyb20

DOI: 10.1080/23335777.2021.1946719

Access Statistics for this article

Cyber-Physical Systems is currently edited by Yang Xiao

More articles in Cyber-Physical Systems from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().