基于禁忌搜索算法的煤炭港口配装计划
|
摘要
针对大型煤炭装卸港口的配煤装船问题(配装问题),分析我国港口配装的特点,以最大化港口吞吐量为目标,建立带特殊约束的网络最大流模型。煤炭港口配装问题是实际生产调度的组合优化问题,考虑船舶服务优先级顺序,设计禁忌搜索算法求解此问题。根据带优先级顺序的组合优化问题的特性,提出了基于初始解的禁忌搜索算法改进。实验表明,改进的禁忌搜索算法具有更好的收敛性,算法的改进有效。
In this paper, to solve the problem of coal blending and loading at large coal ports, we analyzed the characteristics of the blending and loading operations at Chinese ports, and established a network maximum flow model with special constraints to maximize the port throughput. Since the coal blending and loading problem is a combination optimization problem in the actual production scheduling at the coal port and considering the priority order of ship services, we designed a tabu search algorithm to solve the problem and according to the characteristics of the combination optimization problem with priority order, proposed an improved tabu search algorithm based on the initial solution. At the end, a numerical example was used to show that the improved tabu search algorithm has better convergence and improved efficiency.
In this paper, to solve the problem of coal blending and loading at large coal ports, we analyzed the characteristics of the blending and loading operations at Chinese ports, and established a network maximum flow model with special constraints to maximize the port throughput. Since the coal blending and loading problem is a combination optimization problem in the actual production scheduling at the coal port and considering the priority order of ship services, we designed a tabu search algorithm to solve the problem and according to the characteristics of the combination optimization problem with priority order, proposed an improved tabu search algorithm based on the initial solution. At the end, a numerical example was used to show that the improved tabu search algorithm has better convergence and improved efficiency.
引文
[1]金林华.关于动力配煤原理在港口的实践[J].煤质技术,2017,(S1):50-52.
[2]Boland N,Gulczynski D,Savelsbergh M.A stockyard planning problem[J].EURO Journal on Transportation and Logistics,2012,1(3):197-236.
[3]Savelsbergh M,Smith O.Cargo assembly planning[J].EURO Journal on Transportation and Logistics,2015,4(3):321-354.
[4]Wen C,Zheng L.A Constraint Programming Based Method for Stockyard Management Problem[A].International Conference on Internet and Distributed Computing Systems[C].2016.
[5]Glover F.Tabu Search:A Tutorial[J].Interfaces,1990,20(4):74-94.
[6]Jiefeng X U,Kelly J P.A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem[J].Transportation Science,1996,30(4):379-393.
[7]杨文强,邓丽,费敏锐,等.基于改进禁忌搜索的多目标自动化仓库调度[J].计算机集成制造系统,2013,19(8):2 097-2 104.
[8]王宏斌,刘娜.基于优先权编码的改进禁忌搜索算法求解TSP问题[J].物流科技,2017,40(6):29-32.
[9]Ahuja R K,Magnanti T L,Orlin J B.Network flows:theory, algorithms, and applications[J].Journal of the Operational Research Society,1993,45(11):791-796.
[2]Boland N,Gulczynski D,Savelsbergh M.A stockyard planning problem[J].EURO Journal on Transportation and Logistics,2012,1(3):197-236.
[3]Savelsbergh M,Smith O.Cargo assembly planning[J].EURO Journal on Transportation and Logistics,2015,4(3):321-354.
[4]Wen C,Zheng L.A Constraint Programming Based Method for Stockyard Management Problem[A].International Conference on Internet and Distributed Computing Systems[C].2016.
[5]Glover F.Tabu Search:A Tutorial[J].Interfaces,1990,20(4):74-94.
[6]Jiefeng X U,Kelly J P.A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem[J].Transportation Science,1996,30(4):379-393.
[7]杨文强,邓丽,费敏锐,等.基于改进禁忌搜索的多目标自动化仓库调度[J].计算机集成制造系统,2013,19(8):2 097-2 104.
[8]王宏斌,刘娜.基于优先权编码的改进禁忌搜索算法求解TSP问题[J].物流科技,2017,40(6):29-32.
[9]Ahuja R K,Magnanti T L,Orlin J B.Network flows:theory, algorithms, and applications[J].Journal of the Operational Research Society,1993,45(11):791-796.