.png){kind=icon}
返回
An algorithm for the capacitated, multi-commodity multi-period facility location problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(99)00126-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
There are substantial number of exact and heuristic solution methods proposed for solving the facilities location problems. This paper develops an algorithm to solve the capacitated, multi-commodity, multiperiod (dynamic), multi-stage facility location problem. The literature on such composite facility location problem is still sparse, The proposed algorithm consists of two parts: in the first part branch and bound is used to generate a list of candidate solutions for each period and then dynamic programming is used to find the optimal sequence of configurations over the multi-period planning horizon. Bounds commonly known in the location literature as delta and omega are used extensively to effectively reduce the total number of transshipment subproblems needed to be solved. The proposed algorithm is particularly effective when the facility reopening and closing costs are relatively significant in the multi-period problem. An example problem is included to illustrate the proposed solution procedure.
Keyword:
facility location
branch and bound algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏DUAL-ASCENT PROCEDURES FOR MULTICOMMODITY LOCATION-ALLOCATION PROBLEMS WITH BALANCING REQUIREMENTS
PREAI
分享收藏
查看更多内容