The berth allocation problem (BAP), which de nes a processing interval and a berth at the quay wall for each ship to be (un-)loaded, is an essential decision problem for e ciently operating a container port. In this paper we integrate mobile quay walls into the BAP. Mobile quay walls are huge propelled oating platforms, which encase ships moored at the immobile quay and provide additional quay ...

In this paper, we study the container stacking problem (CSP) which is one of the most important problems in marine terminal. An optimisation model is developed in order to determine the optimal storage strategy for various container-handling schedules. The objective of the model is to minimise the distance between vessel berthing location and the storage positions of containers. The CSP is solv...

The recent retirement of the Space Shuttle program has prompted NASA to begin outsourcing development of future technologies for transporting supplies and humans to the International Space Station (ISS). Any spacecraft approaching the ISS for docking or berthing is required to estimate its own position relative to the Space Station. We examine a problem of placing sensors on the ISS to aid in p...

Autonomous berthing is the last step to achieving autonomous operation of unmanned surface vehicles (USVs). Due significant disturbance wind, waves, and currents uncertainties model, it difficult realize berthing. For case obstacles dynamics USVs, transformed into three steps including path planning, tracking, motion control USVs in paper. A new advanced Dubins-RRT algorithm proposed for which ...

Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. It has previously been applied to the TSP and QAP with encouraging results that demonstrate its potential. In this paper, we present FF-AS-SBP, an algorithm that applies ACO to the ship berthing problem (SBP), a generalization ...

We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...