Citation: | LI Jian-zhong. Crane dynamic deployment model of container storage yard[J]. Journal of Traffic and Transportation Engineering, 2005, 5(1): 70-74. |
[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
|