.png){kind=icon}
返回
The planar multifacility collection depots location problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2018.09.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The multifacility collection depots problem is the location of one or more facilities among a given set of demand points and a given set of collection depots. Each service consists of a trip to the customer, collection of materials, dropping off the materials at one of the available collection depots, and returning to the facility to wait for the next call. The trip can be done in reverse, i.e., collecting the materials on the way to the customer. The objective is to minimize the total travel time. The same model can be used for locating collection depots among a given set of demand points and existing facilities. The problem is analyzed and several properties proved. A solution within a given accuracy of the optimal solution is found for the single facility problem. Heuristic solutions are proposed for locating multiple facilities. Extensive computational experiments confirm the effectiveness of the solution approaches. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Facility location
Hub location
Collection depots
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
查看更多内容