DEVELOPING A YARD CRANE SCHEDULING MODEL FOR A CONTAINER TERMINAL

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

JAVANSHIR H.; FATEMI GHOMI M.S.; FATEMI GHOMI S.M.T.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Transportation Engineering Year:2011 | Volume:2 | Issue:4 (8) Page(s): 291-301

Download Full-Text

Persian Verion

View:

924

Download:

Cites:

Information Journal Paper

Title

DEVELOPING A YARD CRANE SCHEDULING MODEL FOR A CONTAINER TERMINAL

Author(s)

JAVANSHIR H. | FATEMI GHOMI M.S. | FATEMI GHOMI S.M.T. | Issue Writer Certificate

Keywords

CONTAINER TERMINALQ3

YARD CRANEQ3

SCHEDULINGQ2

CONTAINERQ2

Abstract

According to the figures issued by UNCTAD, CONTAINERized trade is forecasted to grow by an average annual rate of 5.32 percent between the years 2003 and 2025. This paper studies YARD CRANE SCHEDULING problem between different blocks for a CONTAINER TERMINAL. The purpose is to minimize the total travel time of the cranes among the blocks and also, the total delayed workload in each block at different time periods. In other words, the forecasted workload within each planning period, additional crane capacity or insufficient crane capacity for each block, the time when cranes should be deployed and the routes of crane movements, all should be determined in a way that satisfies our objectives. Therefore, the problem is formulated as a mixed integer programming (MIP) model. The block pairs between which YARD CRANEs will be transferred during the various periods, are determined by this model. Afterwards, the model is coded by LINGO which uses branch and bound algorithm for solving. The results determine the YARD CRANE movement sequences among the blocks to achieve minimum total travel time for cranes and minimum total delayed workload in blocks at different periods. The biggest portion of the objective function value, for example, with 13 blocks, eight of which lack carne capacity is related to the total travel time of the cranes within the blocks. It is caused by the slow motion of the YARD CRANEs and their large size. Also, total delayed workload calculated for four problems, decreases over the six time periods until it becomes zero. In other words, YARD CRANEs are deployed in an optimal manner. Also, the results show the efficiency of the developed program.

Cites

No record.

References

No record.

Cite

APA: Copy

JAVANSHIR, H., FATEMI GHOMI, M.S., & FATEMI GHOMI, S.M.T.. (2011). DEVELOPING A YARD CRANE SCHEDULING MODEL FOR A CONTAINER TERMINAL. JOURNAL OF TRANSPORTATION ENGINEERING, 2(4 (8)), 291-301. SID. https://sid.ir/paper/223927/en

Vancouver: Copy

JAVANSHIR H., FATEMI GHOMI M.S., FATEMI GHOMI S.M.T.. DEVELOPING A YARD CRANE SCHEDULING MODEL FOR A CONTAINER TERMINAL. JOURNAL OF TRANSPORTATION ENGINEERING[Internet]. 2011;2(4 (8)):291-301. Available from: https://sid.ir/paper/223927/en

IEEE: Copy

H. JAVANSHIR, M.S. FATEMI GHOMI, and S.M.T. FATEMI GHOMI, “DEVELOPING A YARD CRANE SCHEDULING MODEL FOR A CONTAINER TERMINAL,” JOURNAL OF TRANSPORTATION ENGINEERING, vol. 2, no. 4 (8), pp. 291–301, 2011, [Online]. Available: https://sid.ir/paper/223927/en

Related Journal Papers