.png){kind=icon}
返回
Capacitated location-allocation problems on a line
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(00)00084-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For economic and other reasons, distribution networks are often constructed in hierarchies, where, due to high costs, high-level distribution channels are built in straight lines from which low-level channel branch. Branching facilities, too, may incur high costs and thus, their number, locations along the lines, and allocation of destinations to them are important components in system design, which can be accomplished by solving a series of capacitated location-allocation problems on a line. This problem is studied here and its properties are discussed, and appropriate mathematical optimization models formulated and their properties and complexity are also considered. Heuristic solution schemes and lower bounds on objective values are proposed for the models. The efficiency and effectiveness of these schemes are evaluated and more insight into the models is gained through a numerical study. The major conclusion is that the hierarchical structure considered is highly restrictive and imposes high costs. Therefore, its use must be properly justified.
Keyword:
location-allocation
mixed integer programming
distribution
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
.png){kind=icon}
查看更多内容