.png){kind=icon}
返回
New stochastic models for capacitated location-allocation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0360-8352(03)00021-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Capacitated location-allocation problem with stochastic demands is originally formulated as expected value model, chance-constrained programming and dependent-chance programming according to different criteria. For solving these stochastic models efficiently, the network simplex algorithm, stochastic simulation and genetic algorithm are integrated to produce a hybrid intelligent algorithm. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed algorithm. (C) 2003 Elsevier Science Ltd. All lights reserved.
Keyword:
stochastic programming
location-allocation problem
genetic algorithm
simulation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
Solution algorithms for the capacitated single allocation hub location problem容量受限的单分配枢纽选址问题的求解算法
.png){kind=icon}
PREAI
分享收藏
查看更多内容