This reasearch studies ACO algorithms for the switch engine scheduling in a Railroad Yard. The cars are moved individually or grouped into blocks by a set of locomotives called switch engines which are dedicated to moving around the cars in the yard. The need for moving comes from the fact that the arriving trains are disassembled into blocks of cars, undergo some operations like, loading , unl...

The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel, in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of contai...

In this paper, we claim that the operation schedule of automated stacking cranes (ASC) in storage yard container terminals can be built effectively and efficiently by using a crane dispatching policy, propose noisy optimization algorithm named N-RTS derive such policy efficiently. To select job for an ASC, our uses multi-criteria scoring function to calculate score each candidate weighted summa...

In a container terminal, containers unloaded from a ship are moved to the yard during the import operation. The export operation is the reverse of the import process. When a ship is served by multiple shore-cranes having both loading and unloading activities at the same time, a yard-machine can process an import container and an export container in one single round-trip. This paper investigates...

Crane scheduling in container terminals is known as a difficult optimization problem that has become even more challenging in recent years with the proliferation of multi-gantry automated stacking cranes. In this paper we present an efficient algorithm solving a subproblem arising in this context, namely deciding the priority of cranes after transportation tasks have been assigned. We tackle th...

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...

As the flagship of Hutchison Port Holdings (HPH), Hongkong International Terminals (HIT) is the busiest container terminal on the planet. HIT receives over 10,000 trucks and 15 vessels a day, about six million twenty-foot equivalent units (TEUs) a year. HIT makes hundreds of operational decisions a minute. HIT’s terminal management system, the productivity plus program (3P), optimizes resources...

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...

In a modern rail–rail transshipment yard huge gantry cranes transship containers between different freight trains, so that hub-and-spoke railway systems are enabled. In this context, we consider the transshipment yard scheduling problem (TYSP) where trains have to be assigned to bundles, which jointly enter and leave the yard. The objective is to minimize split moves and revisits. Split moves a...