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 work, we study the integrated berth and crane scheduling problem in a tidal port with multiple terminals, considering uncertainties, tides, maximum coverage of cranes interference between cranes. For coping certain number randomly generated samples are used to evaluate solutions, slack variables introduced reduce impact caused by variation vessel arrival operational efficiency. A novel ...

This work introduces a fuzzy optimization model, which solves in an integrated way the berth allocation problem (BAP) and quay crane (QCAP). The is solved for multiple quays, considering vessels’ imprecise arrival times. model optimizes use of quays. BAP + QCAP, NP-hard (Non-deterministic polynomial-time hardness) combinatorial problem, where decision to assign available quays each vessel adds ...

Structural response of quay crane should take more attention with the growth worldwide logistics demand and size. This paper analyzes mechanism metallic structure induced by trolley traveling. An on-site test has been conducted. The time domain girder acceleration signal shows that main influence traveling on is high-frequency impact passing through hinge point. spectrum frequency vertical vibr...

Management and scheduling of flights and assignment of gates to aircraft play a significant role to improve the performance of the airport, due to the growing number of flights and decreasing the flight times. This research addresses the assignement and scheduling problem of runways and gates simultaneously. Moreover, this research is the first study that considers the constraint of unavailabil...

We consider the barge rotation planning and quay scheduling problem in the Port of Rotterdam. This problem concerns the alignment of barge rotations and terminal quay schedules. We use a Multi-Agent based approach for the problem, since such a Multi-Agent based system can mirror to a large extent the way the business network is currently organized. Moreover, it can provide a solution that is ac...

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

This paper presents a novel bi-objective manpower scheduling problem that minimizes the penalty resulted from employees’ assignment at lower skill levels than their real skill and maximizes employees’ utility for working at a special skill level in some shifts or on some days. Employees are classified in two specialist groups and three skill levels in each specialization. In addition, the prese...