Storage Space Allocation of Inbound Container in Railway Container Terminal | Zendy

Li Wang | Zendy; Xiaoning Zhu | Zendy; Zhengyu Xie | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Storage Space Allocation of Inbound Container in Railway Container Terminal

Author(s) -

Li Wang,

Xiaoning Zhu,

Zhengyu Xie

Publication year - 2014

Publication title -

mathematical problems in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.262

H-Index - 62

eISSN - 1026-7077

pISSN - 1024-123X

DOI - 10.1155/2014/956536

Subject(s) - container (type theory) , terminal (telecommunication) , computer science , workload , process (computing) , space (punctuation) , resource allocation , mathematical optimization , distributed computing , computer network , engineering , operating system , mathematics , mechanical engineering

Efficient storage strategy of railway container terminals is important in balancing resource utilization, reducing waiting time, and improving handling efficiency. In this paper, we consider the formulation and solution algorithm for storage space allocation problem of inbound containers in railway container terminal. The problem is formulated as two-stage optimization models, whose objectives are balancing the workload of inbound containers and reducing the overlapping amounts. An algorithm implement process based on rolling horizon approach is designed to solve the proposed models. Computational experiments on an actual railway container terminal show that the proposed approach is effective to solve space allocation problem of inbound container and is significant for the operation and organization of railway container terminals

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research