Title
Efficient methods for stochastic joint replenishment and delivery problem
Abstract
In this paper, we consider the joint replenishment and delivery scheduling of the one-warehouse, n-retailer system with stochastic demand. In this distribution system, items are first jointly replenished and therefore can share a major ordering cost. Then a coordinated delivery scheduling is adopted to arrange the delivery plan. The problem is formulated as a mixed integer nonlinear program. Subsequently, we introduce two algorithms to handle this complex problem: a Lipschitz optimization method and a modified RAND heuristic. Numerical experiments show that the proposed methods are quite efficient. Sensitivity analysis also shows some interesting findings in terms of management.
Year
DOI
Venue
2022
10.1111/itor.12905
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Keywords
DocType
Volume
joint replenishment, mixed integer non&#8208, linear program, Lipschitz optimization, heuristic algorithm
Journal
29
Issue
ISSN
Citations 
4
0969-6016
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Sirui Wang121.37
Lin Wang200.34