码头堆场龙门起重机动态配置优化模型

李建忠

码头堆场龙门起重机动态配置优化模型

李建忠

上海海事大学经济管理学院, 上海 200135

基金项目:

国家自然科学基金项目 70371012

详细信息

作者简介:
李建忠(1980-), 男, 河北沧州人, 上海海事大学硕士研究生, 从事港口资源配置研究

中图分类号: U653.921
计量
- 文章访问数: 260
- HTML全文浏览量: 72
- PDF下载量: 188
- 被引次数: 0
出版历程
- 收稿日期: 2004-11-21
- 刊出日期: 2005-03-25

Crane dynamic deployment model of container storage yard

LI Jian-zhong

School of Economics and Management, Shanghai Maritime University, Shanghai 200135, China

More Information

Author Bio:
LI Jian-zhong(1980-), male, graduate student, 86-21-58520274, zero_ljz@sina.com

摘要

摘要: 为了优化轮胎式龙门起重机的动态配置, 建立一个多目标非线性数学规划模型, 以各箱区总的未按计划完成工作箱量所需的龙门起重机时间和龙门起重机闲置时间的最小化为目标函数, 采用基于启发式方法的Lagrangian松弛算法, 求取轮胎式龙门起重机的动态配置近似最优解。算例测试表明, 算法的平均相对对偶间隙为1%, 平均计算时间为4 min, 这种方法对于港口堆场内轮胎式龙门起重机的动态优化配置是有效的。
- 港口 /
- 堆场 /
- 集装箱 /
- 龙门起重机 /
- 拉格朗日松弛算法 /
- 配置
Abstract: In order to optimize the dynamic deployment for rubber tyred gantry crane, this paper constructed a nonlinear multi-objective programming model. In the model, the minimum time of uncompleted workloads and the minimum wasted time of workloads were optimal objects, the problem was solved by Lagrangian algorithm based on heuristic method. Computation results show that the average duality gap is within 1%, the average computation time is 4 min, which demonstrates the model is feasible.
- port /
- yard /
- container /
- crane /
- Lagrangian relaxation method /
- deployment

HTML全文

表 1 移动时间

Table 1. Traveling time /min

箱区号	1	2	3	4	5	6	7	8	9	10
1	0	10	20	20	25	25	30	30	35	35
2	10	0	20	20	25	25	30	30	35	35
3	20	20	0	10	20	20	25	25	30	30
4	20	20	10	0	20	20	25	25	30	30
5	25	25	20	20	0	10	20	20	25	25
6	25	25	20	20	10	0	20	20	25	25
7	30	30	25	25	20	20	0	10	20	20
8	30	30	25	25	20	20	10	0	20	20
9	35	35	30	30	25	25	20	20	0	10
10	35	35	30	30	25	25	20	20	10	0

下载: 导出CSV

表 2 计划所需时间

Table 2. Demand time of plan /min

阶段	箱区
阶段	1	2	3	4	5	6	7	8	9	10
1	157	64	74	76	59	55	55	42	64	64
2	56	56	54	48	74	54	56	53	44	57
3	51	65	43	45	64	56	62	64	54	45
4	163	53	96	76	45	78	65	61	62	64
5	62	66	56	65	56	67	74	52	62	49
6	56	70	45	57	54	69	76	66	64	57
7	71	40	64	62	65	65	54	54	46	64
8	56	45	62	55	55	45	44	52	74	54

下载: 导出CSV

表 3 未完成计划所需时间的最大值

Table 3. Demand maximal time of uncompleted plan /min

阶段	箱区
阶段	1	2	3	4	5	6	7	8	9	10
1	3	12	4	9	9	5	5	3	3	4
2	4	2	3	4	3	4	6	3	4	7
3	2	5	3	4	5	4	4	4	4	5
4	3	3	6	6	5	0	4	4	3	4
5	2	2	2	3	2	3	2	4	2	0
6	4	4	4	3	3	8	6	5	4	0
7	4	4	4	3	6	6	3	3	4	4
8	3	5	4	3	7	3	3	4	3	4

下载: 导出CSV

表 4 初始各箱区配置龙门起重机台数

Table 4. Crane number in each block

箱区号	1	2	3	4	5	6	7	8	9	10
数量	3	1	1	1	1	1	2	1	1	1

下载: 导出CSV

参考文献(13)

[1]	周秀菁. 码头堆场设备选型[J]. 集装箱化, 2002, 5(6): 33-34. doi: 10.3969/j.issn.1005-5339.2002.06.015 ZHOU Xiu-jing. Selection of yard machine in port[J]. Containerization, 2002, 5(6): 33-34. (in Chinese) doi: 10.3969/j.issn.1005-5339.2002.06.015
[2]	刘刚, 宋德星. 西部水路集装箱堆场门式起重机选型[J]. 交通运输工程学报, 2001, 1(4): 111-114. doi: 10.3321/j.issn:1671-1637.2001.04.025 LIU Gang, SONG De-xing. Approach to type selection for container stack gantry crane in waterway port in west of China[J]. Journal of Traffic and Transportation Engineering, 2001, 1 (4): 111-114. (in Chinese) doi: 10.3321/j.issn:1671-1637.2001.04.025
[3]	Lai K K, Lam K. A study of container yard equipment allocation strategy in Hongkong[J]. International Journal of Modeling and Simulation, 1994, 14(3): 134-138. doi: 10.1080/02286203.1994.11760228
[4]	Ballis A. A container terminal simulation model with animation capabilities[J]. Journal of Advanced Transportation, 1996, 30(1): 37-55. doi: 10.1002/atr.5670300104
[5]	Kim K H, Kim K Y. An optimal routing algorithm for a transfer crane in port container terminals[J]. Transportation Science, 1999, 33(1): 17-33. doi: 10.1287/trsc.33.1.17
[6]	Kozan P. Genertic algorithm to schedule container transfer at multimodal terminals[J]. International Transportation in Operational Research, 1999, 6(3): 311-328. doi: 10.1111/j.1475-3995.1999.tb00158.x
[7]	Fisher M L. The Lagrangian relaxation method for solving interger programming problem[J]. Management Science, 1981, 27(1): 1-18. doi: 10.1287/mnsc.27.1.1
[8]	Geoffrion A M. Lagrangian relaxation for interger programming[J]. Mathematical Programming Study, 1974, 29(6): 82-114.
[9]	Luh P B, Hoitomt D J. Scheduling of manufacturing systems using the Lagrangian relaxation technique[J]. IEEE Transactions on Automatic Control, 1993, 38(7): 1 066-1 079. doi: 10.1109/9.231461
[10]	Pirkul H, Schilling D A. An efficient procedure for designing single allocation hub and spoke systems[J]. Management Science, 1991, 44(12): 235-242.
[11]	Polyak B T. Minimization of unsmooth functionals[J]. USSR Computational Mathematics and Mathematical Physics, 1969, 9(6): 14-29.
[12]	王朝晖, 甘文泉, 陈浩勋, 等. 具有模糊缓冲库存约束的化工批处理过程的调度[J]. 系统工程理论与实践, 1998, 8(7): 63-67. https://www.cnki.com.cn/Article/CJFDTOTAL-XTLL807.009.htm WANG Zhao-hui, GAN Wen-quan, CHEN Hao-xun, et al. Batch chemical processes scheduling with fuzzy constraints [J]. System Engineering Theory and Practice, 1998, 8(7): 63-67. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XTLL807.009.htm
[13]	唐立新, 杨自厚, 王梦光. 新的Lagrangian松弛法求解CLSP问题[J]. 系统工程学报, 1999, 14(1): 11-13. https://www.cnki.com.cn/Article/CJFDTOTAL-XTGC901.001.htm TANG Li-xin, YANG Zi-hou, WANG Meng-guang. New Lagrangian relaxation algorithms to solve CLSP[J]. Journal of System Engineering, 1999, 14(1): 11-13. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XTGC901.001.htm