A New Optimization via Invasive Weeds Algorith for Berth Allocation Problem in Container Terminals

Transportation speed has an important role in global trade, therefor the main purposes of a container terminal are increasing efficiency and reduction of ships departure delay from port. A ship idle time depends on efficiency of berth scheduling and containter terminal resources allocation, which the optimal management of terminals will incease efficiency of ports. The vessels service time could be used as the main factor in order to increase the efficiency of container terminals. The berth allocation to vessles are known as the first and most important decision in most container terminals. In this paper we first studied the berth allocation problem and then was evaluated the proposed model with an invasive weeds algorithm. Finally, the effectiveness of the proposed method was compared with the results of GAMS commercial software. The proposed algorithm in addition to high quality results, especially for large size problems has much higher speed than the GAMS software.