.png){kind=icon}
返回
A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(97)00096-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distribution system design problems commonly occurs in the following form: A number of production plants supply warehouses with multiple products which in turn distribute these products to customer outlets based on their specified demand quantities of the different products. It is required to select the optimum set of plants and warehouses from a potential set and plan production capacities, warehouse capacities and quantities shipped so that the total operating costs of the distribution network are minimized. This paper is a computational study to investigate the value of coordinating production and distribution planning. We present a mixed integer programming formulation for the capacitated plant and warehouse supply chain management problem and propose an efficient heuristic based on Lagrangian relaxation of the problem. (C) 1998 Elsevier Science Ltd. All rights reserved.
Keyword:
SINGLE-SOURCE CONSTRAINTS
ALGORITHM
DECOMPOSITION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
A LAGRANGIAN HEURISTIC FOR THE CAPACITATED PLANT LOCATION PROBLEM WITH SINGLE-SOURCE CONSTRAINTS具有单源约束的容量限制工厂选址问题的拉格朗日启发式方法
PREAI
分享收藏分享收藏
查看更多内容