[1] AZEVEDO A, RIBEIRO C, SENA G, et al. Solving the 3D container ship loading planning problem by representation by rules and meta-heuristics[J]. International Journal of Data Analysis Techniques and Strategies, 2014(6): 228-260.
[2] DING D, CHOU M C. Stowage planning for container ship: A heuristic algorithm to reduce the number of shifts[J]. European Journal of Operational Research, 2015(246): 242-249.
[3] AMBROSINO D, PAOLUCCI M, SCIOMACHENA A. A MIP heuristic for multi-port stowage planning[J]. Transportation Research Procedia, 2015(10): 725-734.
[4] 祝慧灵, 计明军. 集装箱船舶全航线配载优化模型与改进遗传算法[J]. 交通运输工程学报, 2014, 14(5): 59-67. [ZHU H L, JI M J. Optimal model and improved genetic algorithm of containership stowage on full route[J]. Journal of Traffic and Transportation Engineering, 2014, 14(5): 59-67.]
[5] AMBROSINO D, PAOLUCCI M, SCIOMACHENA A. Computational evaluation of a MIP model for multi-port stowage planning problems[J]. Soft Computing, 2017 (21): 1753-1763.
[6] ARAÚJO E J, CHAVES A A, NETO L L S, et al. Pareto clustering search applied for 3D container ship loading plan problem[J]. Expert Systems with Applications, 2016 (44): 50-57.
[7] DONG J X, LEE C H, SONG D P. Joint service capacity planning and dynamic container routing in shipping network with uncertain demands[J]. Transportation Research Part B, 2015(78): 404-421.
[8] 杨华龙, 刘迪, 夏秋. 集装箱班轮多港挂靠循环航次舱位分配[J]. 重庆交通大学学报(自然科学版), 2012, 31 (6): 1248-1251. [YANG H L, LIU D, XIA Q. Slot allocation of container liner in multi-port call cycle voyage[J]. Journal of Chongqing Jiaotong University (Natural Science), 2012, 31(6): 1248-1251.]
[9] 郭子坚, 许松乔, 王文渊, 等. 集装箱港口堆场箱位数的二阶段随机规划方法[J]. 哈尔滨工程大学学报, 2013, 34(12): 1520-1523. [GUO Z J, XU S Q, WANG W Y, et al. The two-stage stochastic programming method for determining the number of flat containers in the port yard[J]. Journal of Harbin Engineering University, 2013, 34(12): 1520-1523.]
[10] ZHAO R Q, LIU B D. Stochastic programming models for general redundancy optimization problems[J]. IEEE Transaction on Reliability, 2003, 52(2): 181-191. |