The logistics operation of container terminal can be exploded into several subsystems which are correlative, these subsystems connect by some handling facilities. This paper study the coordinated scheduling of three main kinds of facilities-Quay Crane(QC),Yard Truck(YT) and Yard Crane(YC), use multidisciplinary variable coupling design optimization method(MVCDO) to build YT coordinated scheduli...

The quay crane scheduling problem (QCSP) determines the handling sequence of tasks at ship bays by a set of cranes assigned to a container vessel such that the vessel’s service time is minimized. A number of heuristics or metaheuristics have been proposed to obtain the near-optimal solutions to overcome the NP-hardness of the problem. In this article, the idea of generalized extremal optimizati...

In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). We present two formulations: a mixed intege...

Vessel discharge and load jobs in a container terminal can be divided into sequences, one for each assigned quay crane (QC). A QC sequence lists containers in their desired handling order. The common practice for operators is to make do with just this sequence, without generating a job schedule (i.e. desired start-times of handling each container). Operators who need job schedules generate crud...

Keywords: Container terminal Maritime shipping Block length Yard crane deployment Simulation Terminal design Gross crane rate As more and more container terminals open up all over the world, terminal operators are discovering that they must increase quay crane work rates in order to remain competitive. In this paper we present a simulation study that shows how a terminal's long-run average quay...

The quay crane scheduling problem studied in this paper is to determine a handling sequence of holds for quay cranes assigned to a container vessel considering interference between quay cranes. This paper provides a mixed integer programming model for the considered quay crane scheduling problem that is NP-complete in nature. A genetic algorithm is proposed to obtain near optimal solutions. Com...

Quay crane allocation is one of the most important scheduling plans in the container terminal. A large of production data is stored in the database of the terminal. This paper utilizes the method of data mining to analyze the problem of quay crane allocation by using these data. From the mining, valuable information has been gotten from the database. The paper chooses the fuzzy cmeans cluster a...

In this paper we integrate two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). They are indeed strictly correlated, as the QC profile assigned t...

Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...

With the regular development of global epidemic, port shipping supply is tight. The problem congestion, soaring freight rates, and hard-to-find container space has emerged. This paper proposes a new joint berth-quay crane allocation model, namely E-B&QC, by taking minimum time in ship, cost extra transportation distance for collector trucks land area port, waiting ships. Then, deficiencies spar...