基于Lagrangian松弛启发算法的物流中心地址研究
Logistics Center Location Allocation Study Based on the Lagrangian Relaxation Heuristic Algorithm
本文针对需求不确定的物流配送网络中心的选址问题，按照成本最低化原则建立混合整数非线性规划模型，采用Lagrangian松弛启发式算法求解，计算相对简单，精确度和收敛程度都非常高。
In order to select logistics centers location under uncertain demand; we set up a model of hybrid integral nonlinear programming, and solved the problem simply by Lagrangian relaxation heuristic algorithm, which has better character of precision and astringency.
关忠良、马红、蔡永明
交通运输经济综合运输
不确定需求物流配送中心选址Lagrangian松弛启发式算法
logistics center location allocation study under uncertain demandLagrangian relaxation heuristic algorithm
关忠良,马红,蔡永明.基于Lagrangian松弛启发算法的物流中心地址研究[EB/OL].(2006-10-20)[2025-08-23].http://www.paper.edu.cn/releasepaper/content/200610-288.点此复制
评论