期刊文献+

成本与半径优化的设施选址问题 被引量:11

Facility Location Problem with Cost and Radius Optimization
下载PDF
导出
摘要 成本与半径优化的服务设施选址问题(CROFL)广泛应用于应急服务、快递、维修网络等领域,其特点是考虑了响应速度与服务价格、成本之间的关系,根据净收益最大化或者成本最小化的原则自动判断是否将偏远的"需求点"纳入服务半径之内,实现服务成本与服务半径的双重优化。建立了CROFL的混合整数规划模型,构造了求解平面CROFL的7.853+ε-近似算法,并提供了求解一般CROFL的Benders分解算法,计算实验显示,Benders分解算法具有非常高的求解效率与求解质量。 The facility location problem with cost and radius optimization (FLCRO) has a wide range of applications in emergency response, logistics, maintenance service as well as express delivery. By considering the relationship of response time, service benefits and service costs, the problem seeks a decision on whether the distant customers are brought into the range of service radius or not. Both service cost and service radius are taken into consideration in the model. We construct a mixed 0-1 integer programming model for the problem and present a 7. 853 4+ε-approximation algorithm for FLCRO on a plane. We also provided a heuristic algorithm based on benders' decomposition which is very effective in solving FLCRO.
作者 翁克瑞 杨超
出处 《系统管理学报》 CSSCI 2012年第3期352-356,共5页 Journal of Systems & Management
基金 国家自然科学基金资助项目(71102151)
关键词 设施选址 服务半径 服务成本 facility location service radius service cost
  • 相关文献

参考文献11

  • 1Melo M T, Nickel S, Saldanha-da-Gama F. Facility location and supply chain management -a review[J].European Journal of Operational Research, 2009, 196: 401-412.
  • 2Farahani R Z, SteadieSeifi M, Asgari N, Multiple criteria facility location problems: A survey[J].Applied Mathematical Modelling, 2010, 34 ( 7 ) : 1689-1709.
  • 3Naji-Azimi Z, Toth P, Galli L. An electromagnetism metaheuristic for the unicost set covering problem [J]. European Journal of Operational Research, 2010, 205: 290-3005.
  • 4ReVelle C, Scholssberg M, Williams J. Solving the maximal covering location problem with heuristic concentration [ J ]. Computers & Operations Research,2008, 35: 445-456.
  • 5Yang B. Medi-center location problems[J], journal of the operational research society, 1991,42:313-322.
  • 6Choi I C, Chaudhry S S. The p-median problem with maximaum distance constrans: A direct approach[J].Location Science, 1993(1) :235 243.
  • 7Piotr K, Roberto S. Approximation algorithms for bounded facility location problems [J]. Journal of Combinatorial Optimization, 2001 ( 5 ) : 233-247.
  • 8Weng K R. Distance constrained facility location problem[A]. IEEE SSME,2009 : 358 361.
  • 9Ambuhl C, Erlebach T, Mihalak M, etal. Constant- factor approximation for minimum weight (connected) dominating sets in unit disk graphs[A]. Proc. APPROX RANDOM, 2006:3-14.
  • 10Huang Y, Gao X, Zhang Z, etal. A better constantfactor approximation for weighted dominating set in unit disk graph[J]. J. Comb. Optim., 2009,18.. 179-194.

同被引文献151

引证文献11

二级引证文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部