نوع مقاله : علمی - پژوهشی
نویسندگان
1 کارشناسی ارشد، دانشکده مهندسی عمران، برنامه‌ریزی حمل‌ونقل، دانشگاه علم و صنعت ایران، تهران، ایران
2 استادیار، دانشکده مهندسی عمران، برنامه‌ریزی حمل‌ونقل، دانشگاه علم و صنعت ایران، تهران، ایران
چکیده
کلیدواژه‌ها
عنوان مقاله [English]
نویسندگان [English]
Berth planning Problems are one the problem related to port management that the answer to these problems can affect the cost of the port and therefore have been studied in many papers and studies. Berth planning includes two subproblems; Berth Allocation Problem and Quay Crane Assignment Problem. This paper intends to merge these two subproblems and develop an integrated mathematical model. An ant colony optimization algorithm is performed to solve this integrated model, which leads to an optimal berth plan that reduces port costs. The initial berth plan is planed assuming that all input data is certain, but this is not true. Unforeseen events may occur during the execution of the initial plan, which may challenge the execution of the initial plan. These types of events, which are generally unpredictable, are called disruptions. The process of recovering the initial berth plan in a way that results in the lowest cost and penalty for the port is called disruption management. So far, two general methods have been introduced for the recovery and management of berth allocation disruption; the Global recovery method and the local recovery method. This paper introduces a local recovery method by eliminating the weaknesses of the previous local recovery method and developing it. In order to validate the methods of solving mathematical models, the data of ships' entry and exit in both container terminals of Shahid Rajaei port are used. The numerical results of this paper show that local recovery methods perform much better than the global recovery method (the optimal response in local methods in the first terminal is about 120% and in the second terminal is about 300% better than the response in the global recovery method). The two methods of local recovery and the developed local recovery method have almost similar answers. However, reaching the final answer in the developed local recovery method is approximately 2 to 3 times faster.
کلیدواژه‌ها [English]
)
