.png){kind=icon}
返回
An evolutionary algorithm to solve the joint replenishment problem using direct grouping
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2005.01.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
There has been much work in establishing a joint replenishment policy to minimize the total cost of inventory replenishment. Most of this work uses the indirect grouping method. Little research has been done with direct grouping methods. In this paper we develop an evolutionary algorithm (EA) that uses direct grouping to solve the joint replenishment problem (JRP). We test the EA and compare these results with results with the best available algorithm. The EA is shown to find a replenishment policy that incurs a lower total cost than the best available algorithm for some problem parameters. (c) 2005 Elsevier Ltd. All rights reserved.
Keyword:
evolutionary algorithms
joint replenishment problem
direct grouping
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
Calcium/calmodulin-dependent protein kinases in the carotid body: an immunohistochemical study.png)
SpringerPlus
OAAI
SpringerPlusIF0
OAAI分享收藏Abi1 mediates airway smooth muscle cell proliferation and airway remodeling via Jak2/STAT3 signalingiScience
OAAI
iScienceIF0
OAAI分享收藏
查看更多内容