Modelling and Metaheuristic for Gantry Crane Scheduling and Storage Space Allocation Problem in Railway Container Terminals

Zeng, Ming; Cheng, Wenming; Guo, Peng

doi:10.1155/2017/9025482

Cited by 7 publications

(6 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tang et al [23] proposed a new MIP model to integrate SSAP and ship scheduling to achieve high space utilization, low material loss, and low transportation costs. Zeng et al [24] studied the coordination of SSAP and RMGC scheduling problem in railway container terminals, considering some operational constraints and storage modes. However, the specific locations of containers cannot be determined.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Although the literatures above concentrated on combining SSAP with some other scheduling problems, they neglected the whole process of handling operations; for example, Zeng et al [24] did not consider the specific storage constraints and the interrelation between the quayside area and railway operation area.…”

Section: Literature Reviewmentioning

confidence: 99%

“…(24)- (25) indicate that the RMGC g cannot begin to handle the next task until it completes the former task. (24) means that the two continuous tasks are both loading tasks, while (25) implies that the two continuous tasks are loading task and rehandling task. (26) presents that an IT can only begin to deliver the next task from the transfer point of the bay b after the IT delivers the task to the working point of the QC and returns to the transfer point of the bay b.…”

Section: ) Second Stage Optimization Modelmentioning

confidence: 99%

See 2 more Smart Citations

Modeling and Solution of Joint Storage Space Allocation and Handling Operation for Outbound Containers in Rail-Water Intermodal Container Terminals

2019

View full text Add to dashboard Cite

Storage space allocation and handling operation problems are two main crucial problems in container terminals. Early research efforts, however, are seldom devoted to studying them together. Therefore, this paper considers these two problems simultaneously for outbound containers in rail-water intermodal container terminals (RWICTs), where rail-mounted gantry cranes, inner trucks, and quay cranes are involved. A two-stage problem is proposed: Stage 1 is to determine locations of the containers and reduce the overlapping amount, considering container weight, departure time, destination ports, and containers left from earlier planning periods in railway container yards, according to the locations of containers from Stage 1; and Stage 2 aims at obtaining optimal job sequences of different types of equipment and minimizing makespans of handling operations, considering some operational constraints, particularly rehandling time and inner truck congestion. To solve the problem, a two-stage heuristic algorithm is proposed, where the rolling planning horizon and a new update strategy are introduced. A heuristic algorithm is introduced in Stage 1 and a novel two-layer genetic algorithm is proposed in Stage 2, which introduces proximity principles and the reselection operation. Afterward, the results from Stage 2 are used to resolve the first stage problem, while the problem in Stage 2 is also resolved using the new results from Stage 1. This iterative process continues until there are no more improvements in Stage 1. Finally, the results of the computational experiments indicate that the proposed model and solution approaches are effective and efficient in solving the two-stage problem for outbound containers in RWICTs. INDEX TERMS Rail-water intermodal transportation, storage space allocation, handling operation, two-stage algorithm, container terminal. The associate editor coordinating the review of this manuscript and approving it for publication was Roberto Sacile.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: ) Second Stage Optimization Modelmentioning

confidence: 99%

See 1 more Smart Citation

Modeling and Solution of Joint Storage Space Allocation and Handling Operation for Outbound Containers in Rail-Water Intermodal Container Terminals

2019

View full text Add to dashboard Cite

show abstract

“…The dual-GC spans the rail tracks, truck lanes, and storage yard, as shown in Figure 2. Most previous studies regarded GCs as the only handling resources in the main operating area [2][3][4][5][6][7][8]. However, GC has some obvious disadvantages of poor maneuverability, slower efficiency, higher energy consumption, and expensive handling costs, and the ITs in RCT have higher flexibility, faster travel speed, lower energy consumption, and lower transportation costs.…”

Section: Introductionmentioning

confidence: 99%

“…Besides, they further discussed the problem of storage space allocation. Zeng et al [6] considered the operation sequence, non-crossing requirement, safety distance, and storage mode to address the problem of GC scheduling and slot allocation. Wang et al [7] presented the GCs scheduling model to reduce idle time, and ant colony algorithm was developed to obtain solutions.…”

Section: Introductionmentioning

confidence: 99%

Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area

et al. 2021

View full text Add to dashboard Cite

The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and internal trucks (ITs). A creative handling scheme is proposed to reduce the long-distance, full-loaded movement of GCs by making use of the advantages of ITs. Based on this scheme, we propose a flexible crossing crane area to balance the workload of dual-GC. Decomposing the integrated problem into four sub-problems, a multi-objective mixed-integer programming model (MIP) is developed. By analyzing the characteristic of the integrated problem, a three-layer hybrid heuristic algorithm (TLHHA) incorporating heuristic rule (HR), elite co-evolution genetic algorithm (ECEGA), greedy rule (GR), and simulated annealing (SA) is designed for solving the problem. Numerical experiments were conducted to verify the effectiveness of the proposed model and algorithm. The results show that the proposed algorithm has excellent searching ability, and the simultaneous optimization scheme could ensure the requirements for efficiency, effectiveness, and energy-saving, as well as the balance rate of dual-GC.

show abstract

An Intelligent Student Hostel Allocatıon System Based on Web Applications

Azeeta

Misra

Odusami

et al. 2021

Lecture Notes in Electrical Engineering

View full text Add to dashboard Cite

Modelling and Metaheuristic for Gantry Crane Scheduling and Storage Space Allocation Problem in Railway Container Terminals

Cited by 7 publications

References 45 publications

Modeling and Solution of Joint Storage Space Allocation and Handling Operation for Outbound Containers in Rail-Water Intermodal Container Terminals

Modeling and Solution of Joint Storage Space Allocation and Handling Operation for Outbound Containers in Rail-Water Intermodal Container Terminals

Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area

An Intelligent Student Hostel Allocatıon System Based on Web Applications

Contact Info

Product

Resources

About