DocumentCode
2160546
Title
A modified RAND algorithm for multi-buyer joint replenishment problem with resource constraints
Author
Lu, Tao ; Jia, Shunchao ; Li, Yinchang
Author_Institution
School of Economics and Management, Beijing Jiaotong University, China
fYear
2010
fDate
4-6 Dec. 2010
Firstpage
2526
Lastpage
2529
Abstract
This paper focuses on the multi-buyer jointed replenishment problem with resource constraints. The paper first establishes the general mathematical model for this jointed replenishment problem, and then modified the existing heuristic algorithm—RAND algorithm—to solve the problem, by the Lagrange Multiplier. At last, the paper also tests the feasibility of the new modified algorithm via numeric experiments and compares the efficiency of Lingo and the new algorithm.
Keywords
Algorithm design and analysis; Companies; Economics; Heuristic algorithms; Joints; Logistics; Software algorithms; heuristic algorithm; joint replenishment; logistics management; resource constraints;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Science and Engineering (ICISE), 2010 2nd International Conference on
Conference_Location
Hangzhou, China
Print_ISBN
978-1-4244-7616-9
Type
conf
DOI
10.1109/ICISE.2010.5691729
Filename
5691729
Link To Document