.png){kind=icon}
返回
MIP-based approaches for robust storage loading problems with stacking constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2016.08.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider storage loading problems under uncertainty where the storage area is organized in fixed stacks with a limited height. Such problems appear in several practical applications, e.g., when loading container terminals, container ships or warehouses. Incoming items arriving at a partly filled storage area have to be assigned to stacks under the restriction that not every item may be stacked on top of every other item and taking into account that some items with uncertain data will arrive later. Following the robust optimization paradigm, we propose different MIP formulations for the strictly and adjustable robust counterparts of the uncertain problem. Furthermore, we show that in the case of interval uncertainties the computational effort to find adjustable robust solutions can be reduced. Computational results are presented for randomly generated instances with up to 480 items. The results show that instances of this size can be solved in reasonable time and that including robustness improves solutions where uncertainty is not taken into account. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Storage loading
Stacking constraints
Strict robustness
Adjustable robustness
Mixed integer linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
.png){kind=icon}
PREAI
分享收藏
分享收藏分享收藏Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains应急物流规划的稳健优化: 人道主义救援供应链中的风险缓解
PREAI
分享收藏分享收藏Diagnosis, Tuning, and Redesign for Multicore Performance: A Case Study of the Fast Multipole Method
PREAI
分享收藏
查看更多内容