In this paper, the combined problem of berth allocation and crane assignment in container
terminals is investigated. The proposed problem formulation includes important real world …

A comparative, up-to-date, critical review of existing research efforts relating to berth
planning is presented. Existing models are critically reviewed on the basis of their efficiency …

Container terminal (CT) operations are often bottlenecked by slow YC (yard crane)
movements. PM (prime mover) queues in front of the YCs are common. Hence, efficient YC …

Container terminals in seaports constitute interfaces between sea and land transport of
goods in global transport chains. These logistics facilities face an increasing demand of …

In this paper the discrete and dynamic berth allocation problem is formulated as a multi-
objective combinatorial optimization problem where vessel service is differentiated upon …

“Multi-crane oriented” is a scheduling method that yard trailers can be shared by different
quay cranes. In this paper, two models for this problem are developed. The first one is a …

In this paper, we consider the extraction of speaker identity from audio records of broadcast
news without a priori acoustic information about speakers. Using an automatic speech …

In every-day life, people and goods have to be transported from one place to another by
different kinds of resources, eg buses, trains, airplanes and ships, but also transport belts …

Containers allocation in terminals has attracted lots of research works due to practical &
theoretical importance in transportation literature. In this paper, we developed a fuzzy …

Summary The Berth Allocation Problem consists of assigning berthing times and berthing
positions to container vessels calling at a seaport. We extend this problem by a so-called cut …