计算机工程与应用2013，Vol.49Issue(5)：241-247,7.DOI:10.3778/j.issn.1002-8331.1207-0398
求解动态停泊计划问题的拉格朗日松弛算法
Lagrangian relaxation algorithm for dynamic berth planning problem
刘悦 1谢谢2
作者信息
- 1. 辽宁信息职业技术学院软件工程系,辽宁辽阳111000
- 2. 沈阳大学制造集成自动化重点实验室,沈阳110044
- 折叠
摘要
Abstract
A dynamic berth planning problem encountered in the iron and steel industry is investigated. The dynamic features reflect that the docks have two or more berths with continuous berth sections and the berth sections on the same berth are not simultaneously available at the planning start time period. This problem is formulated as a 0-1 hybrid mathematical model. An improved Lagrangian relaxation algorithm is presented for the solution in a reasonable running time by introducing four properties to speed up the procedures of solving the sub-problems, updating Lagrangian multipliers and obtaining feasible solutions, respectively. Computational results including 50 real-size problems show that the improved algorithm can reduce more than 80% of the running time of unimproved heuristics.关键词
原料物流/停泊计划/拉格朗日松弛Key words
raw material logistics/berth planning/Lagrangian relaxation分类
信息技术与安全科学引用本文复制引用
刘悦,谢谢..求解动态停泊计划问题的拉格朗日松弛算法[J].计算机工程与应用,2013,49(5):241-247,7.
