OCBLA: A Storage Space Allocation Method for Outbound Containers

被引:0
|
作者
Chen, Xinyu [1 ,2 ]
Hu, Wenbin [1 ,2 ]
机构
[1] Wuhan Univ, Sch Comp Sci, Wuhan, Peoples R China
[2] Wuhan Univ, Shenzhen Res Inst, Wuhan, Peoples R China
来源
ADVANCES IN E-BUSINESS ENGINEERING FOR UBIQUITOUS COMPUTING | 2020年 / 41卷
关键词
OCBLA; ITO algorithm; Shifts; Container stacking;
D O I
10.1007/978-3-030-34986-8_32
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In container yard, the way of allocating space for outbound containers determines the transport efficiency of containers and the management cost. The existing space allocation methods usually have problems such as low computational efficiency, large number of shifts etc. This paper proposes an outbound containers' block-location allocation (OCBLA) method to solve this problem, it has two steps, including allocating a block for containers which arrive at the same time and transported by the same vessel and allocating the specific location for each container. The first step aims to balance the load among blocks and reduce the cost of transportation, and last step uses ITO algorithm to reduce the number of shifts. The ITO algorithm regards every optional place as a moving particle and uses drift operator to control particle moving in the direction of the optimal place, wave operator to control particle exploring around. Having a tendency to explore makes the algorithm to find the optimal result in a limited number of tests, thus improving the computational efficiency. Through experiments it can be seen that this method can reduce the number of shifts during the process of container stacking, and get better results while having good real-time performance.
引用
收藏
页码:450 / 463
页数:14
相关论文
共 50 条
  • [21] The Research of Intelligent Storage Space Allocation for Exported Containers Based on Rule Base
    Yan Wei
    Bao Xue
    Zhao Ning
    Bian Zhicheng
    PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE OF MODERN COMPUTER SCIENCE AND APPLICATIONS, 2013, 191 : 421 - 425
  • [22] Yard allocation for outbound containers based on the unified neutral theory of biodiversity and biogeography
    Min, Zhenyu
    Hu, Wenbin
    Xu, Long
    Xia, Chang
    Wang, Kaikai
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7530 LNAI : 227 - 238
  • [23] A bi-objective model for robust yard allocation scheduling for outbound containers
    Liu, Changchun
    Zhang, Canrong
    Zheng, Li
    ENGINEERING OPTIMIZATION, 2017, 49 (01) : 113 - 135
  • [24] Deriving guidelines of space planning for outbound containers in port container terminals
    Jung, Sung Ho
    Kim, Kap Hwan
    Proceedings of the Fourth International Conference on Information and Management Sciences, 2005, 4 : 413 - 413
  • [25] On Yard Space Allocation for Export and Import Containers
    Feng Meiling
    Yue Wenying
    Sun Junqing
    2011 30TH CHINESE CONTROL CONFERENCE (CCC), 2011, : 2190 - 2195
  • [26] A bilevel storage pricing model for outbound containers in a dry Cross Mark port system
    Qiu, Xuan
    Lam, Jasmine Siu Lee
    Huang, George Q.
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2015, 73 : 65 - 83
  • [27] OPTIMAL ALLOCATION OF STORAGE SPACE
    SAGAN, H
    BISHIR, JW
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1991, 55 (01) : 82 - 90
  • [28] An Improved Storage-Space Selection Model and Algorithm for Outbound Shipping Containers: Considering the Synchronous Operation of Multiple Gantry Cranes in Port Terminals Worldwide
    Zheng, Sisi
    Sha, Jin
    Wang, Aihu
    JOURNAL OF COASTAL RESEARCH, 2019, 35 (05) : 1120 - 1130
  • [29] Yard Space Allocation Algorithm for Unloading Containers at Marine Terminals
    Wang, Xingyu
    Zhao, Ning
    Mi, Chao
    JOURNAL OF MARINE SCIENCE AND ENGINEERING, 2023, 11 (11)
  • [30] A reward-based algorithm for the stacking of outbound containers
    Ozcan, Sel
    Eliiyi, Deniz Tursel
    19TH EURO WORKING GROUP ON TRANSPORTATION MEETING (EWGT2016), 2017, 22 : 213 - 221