A Improved Subgradient Lagrangian Relaxation Algorithm for Solving the Stochastic Demand Inventory Routing Problem. Issue 2 (3rd April 2023)

• Record Type: Journal Article
• Authors: Zhao, Yuan-Yuan; Duan, Qian-qian
• Is Part Of: Cyber-physical systems. Volume 9:Issue 2(2023)
• Page Start: 174
• Page End: 192
• Publication Date: 2023-04-03
• Subjects: Stochastic demand inventory routing problem -- improved subgradient -- Lagrangian relaxation algorithm -- Lagrangian multipliers; Cooperating objects (Computer systems) -- Periodicals; Internet of things -- Periodicals; 006.22
• DOI: 10.1080/23335777.2021.1946719
• Languages: English
• ISSNs: 2333-5777

Abstract

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.