.png){kind=icon}
返回
Heuristics for the single source capacitated multi-facility Weber problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2013.01.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Single Source Capacitated Multi-facility Weber Problem (SSCMWP) is concerned with locating I capacitated facilities in the plane to satisfy the demand off customers with the minimum total transportation cost of a single commodity such that each customer satisfies all its demand from exactly one facility. The SSCMWP is a non-convex optimization problem and difficult to solve. In the SSCMWP, customer locations, customer demands and facility capacities are known a priori. The transportation costs are proportional to the distance between customers and facilities. We consider both the Euclidean and rectilinear distance cases of the SSCMWP. We first present an Alternate Location and Allocation type heuristic and its extension by embedding a Very Large Scale Neighborhood search procedure. Then we apply a Discrete Approximation approach and propose both lower and upper bounding procedures for the SSCWMP using a Lagrangean Relaxation scheme. The proposed heuristics are compared with the solution approaches from the literature. According to extensive computational experiments on standard and randomly generated test sets, we can say that they yield promising performance. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Location-allocation
Single source transportation
Lagrangean relaxation
VLSN search
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Single-Source Capacitated Multi-Facility Weber Problem-An iterative two phase heuristic algorithm单源容量约束的多设施韦伯问题 -- 一种迭代两阶段启发式算法
PREAI
分享收藏
查看更多内容