Problem solving algorithm for the allocation of marine containers according to the capacity and waiting time
The concept of container unloading and loading in container ports for the purpose of unloading and loading is referred to as container allocation. This study assumes that the containers are transported between different segments of the port and must be allocated between the existing segments of the port for transport. The allocation is made to minimize costs. For a good and efficient modeling is written the relationship between the different sections.In this paper, the issue of the allocation of containers to ships, yards, customs, mainland and cranes is examined separately. Also, the problem of allocating ships to the berths is also studied. in both parts, the time of transportation and the capacity of the enclosures are limited in the problem. The literature review shows that the results obtained from solving this problem are not applicable in practice. After mathematical modeling, due to the NP-hardness of the problem, two innovative algorithms have been used to solve the problem. The first PSO method performs the assignment of ships to the dock, and then the second algorithm uses the GA method to allocate containers to different parts. Finally, the proposed algorithm is analyzed and compared. The results of the calculations show that the proposed algorithm has a very high performance in practice and in the real world.
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.