期刊文献+

Implementing Lagrangean Decomposition Technique to Acquire an Adequate Lower Boundon the Facility Location Problem Solution

Implementing Lagrangean Decomposition Technique to Acquire an Adequate Lower Boundon the Facility Location Problem Solution
下载PDF
导出
摘要 In this work, the Lagrangean Relaxation method has been discussed to solve different sizes of capacitated facility location problem (CFLP). A good lower bound has been achieved on the solution of the CFLP considered in this paper. This lower bound has been improved by using the Volume algorithm. The methods of setting two important parameters in heuristic have been given. The approaches used to gain the lower bound have been explained. The results of this work have been compared with the known results given by Beasley. In this work, the Lagrangean Relaxation method has been discussed to solve different sizes of capacitated facility location problem (CFLP). A good lower bound has been achieved on the solution of the CFLP considered in this paper. This lower bound has been improved by using the Volume algorithm. The methods of setting two important parameters in heuristic have been given. The approaches used to gain the lower bound have been explained. The results of this work have been compared with the known results given by Beasley.
出处 《Applied Mathematics》 2013年第8期1168-1172,共5页 应用数学(英文)
关键词 Capacitated Facility Location Problem Lagrangean RELAXATION TECHNIQUE Volume Algorithm RANDOMISED ROUNDING TECHNIQUE Unit Cost TECHNIQUE Capacitated Facility Location Problem Lagrangean Relaxation Technique Volume Algorithm Randomised Rounding Technique Unit Cost Technique
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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