Rescheduling the initial berth plan in the disruption environment

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.

Omidvarpanah Ahmadabadi Ali; Sheikholeslami Abdolreza

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

Journal Paper

Paper Information

Journal: IRANIAN JOURNAL OF MARINE TECHNOLOGY Year:2023 | Volume: | Issue: Page(s): 101-119

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

Rescheduling the initial berth plan in the disruption environment

Author(s)

Omidvarpanah Ahmadabadi Ali | Sheikholeslami Abdolreza | Issue Writer Certificate

Keywords

Berth Allocation Problem (BAP)Q4

Quay Crane Assignment Problem (QCAP)Q4

Rescheduling Berth Plan (RBP)Q4

Local Rescheduling (LR)Q4

Global Rescheduling (GR)Q4

Disruption ManagementQ4

Abstract

Ports are important hubs that connect maritime transport to other modes. For this reason, ports are considered important infrastructures for freight transportation, trade, and the global economy. Therefore, optimizing port plans and operations will play a significant role in port costs and revenues. Berth planning is part of port operations that includes two problems; Berth Allocation Problem (BAP) and Quay Crane Assignment Problem (QCAP). The optimal solution to these two problems can affect the freight transportation speed and cost. This paper integrated modeling two problems BAP and QCAP, and solved them using four metaheuristic algorithms (GA, ICA, TS, ACO). Whereas berth planning is in a disrupted environment and unforeseen events may occur during the program's execution, incurring additional costs for the port, or even stopping the initial plan execution, rescheduling the original berth plan is necessary. This paper uses two methods (global and local rescheduling) with metaheuristic algorithms to find the optimal method for berth rescheduling. Numerical analysis shows the proper performance of GA and ICA algorithms in solving the initial berth planning model and the global rescheduling method. In contrast, for local rescheduling, the ACO algorithm has better performance. Evaluation and validation of models and methods of solving this paper are done using the data of ships' arrival and departure in Shahid Rajaei port.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops