We consider a terminal operator, who provides his logistics services of container handling at multiple terminals within the same port. In this setting, the well-known berth allocation problem can no longer be considered per terminal for two main reasons: i) vessel calls should be spread over the various terminals to avoid peaks and troughs in quay crane utilizations, ii) an allocation of two co...

As the “first service station” for ships in the whole port logistics system, the tugboat operation system is one of the most important systems in port logistics. This paper formulated the tugboat scheduling problem as a multiprocessor task scheduling problem MTSP after analyzing the characteristics of tugboat operation. The model considers factors of multianchorage bases, different operation mo...

Abstract Background In 2017, smaller container ports handled approximately 22% of total containerized cargo. Nowadays liner operators are calling on those with larger ships and demanding fast efficient turnaround the in port. This is possible only if berth has right capacities, working properly achieves a good productivity level. Methodology Productivity level does not depend quay crane capacit...

An improved artificial fish swarm algorithm (AFSA) for solving a combinatorial optimization problem— a berth allocation problem (BAP), which was formulated. Its objective is to minimize the turnaround time of vessels at container terminals so as to improve operation efficiency customer satisfaction. An adaptive artificial fish swarm algorithm was proposed to solve it. Firstly, the basic princip...

this paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. by this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. this is resulted from dividing area into discrete and continuous dimensions. also defining decision var...

In this paper, we study the static discrete berth allocation problems (BAPs) for large-scale time-critical marine-loading scenarios. The objective is to allocate vessels different types of berths so that all can be loaded within minimum time under tidal condition. BAP formalized as a min–max problem. This problem rather complex and are quite numerous in We analyze from novel perspective, find o...