基于最小费用/可靠性比值路的物流配送中心选址问题  

Locating a logistics distribution center based on the time-varying minimum cost-reliability ratio path

作　　者：沙丹[1] 许建修[1] 

机构地区：[1]上海对外贸易学院国际经贸学院,上海201620

出　　处：《上海师范大学学报（自然科学版）》2010年第1期35-42,共8页Journal of Shanghai Normal University(Natural Sciences)

基　　金：上海市教委科研项目(5Z1206)

摘　　要：费用和可靠性是评判一个物流系统是否优良的两个重要指标.一般要求从配送中心到各配送点的运输费用尽可能低,而可靠性则要求尽可能高.讨论了在时变环境下的物流配送中心选址问题,要求从配送中心到各配送点的费用/可靠性比值之和达到最小.模型中考虑的费用和可靠性都是时间的函数.该问题是NP完备的.且给出了求解该问题最优解的一个拟多项式算法.Both cost and reliability are important indices to judge a logistic distribution system to be good or not. Usually, it is requested that the transit cost, from the distribution center to other places, must be as low as possible while the reliability as high as possible. In this paper, we address a type of location problem in a time - varying circumstance, where both transit cost and reliability are functions of departure time t. The problem is to find a place, among all candidates, as a distribution center of the whole logistic system, such that the cost - reliability ratio is minimized. The problem is NP - completeness and we propose some algorithms to obtain the optimal solutions in pseudopolynomial running time.

关 键 词：选址 最短路 算法 时变网络 费用和可靠性比值 

分 类 号：O221.7[理学—运筹学与控制论]