Modeling and solution of the joint quay crane and truck scheduling problem

Tang, Lixin; Zhao, Junqiao; Liu, Jiyin

doi:10.1016/j.ejor.2013.08.050

Cited by 103 publications

(33 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…PSO was proposed to optimize continuous nonlinear functions. In recent years, the PSO has been successfully used to solve certain port operation problems, e.g., BAPs [28] and QC scheduling problems [27]. This article designs a PSO based solution approach to solve model T AP .…”

Section: Pso Based Solution Methodsmentioning

confidence: 99%

“…Objective (24) is similar to the previous defined objective. In Constraints (25)(26)(27)(28), λ ipi p is defined to linearize " γ ip · γ i p ," which is contained in Objective (9). Constraints (29)(30)(31) link the previously defined core variables (γ ip , α i , ε i ) with the new variable β iptd , which is also the most important variable in the model T AP Bal .…”

Section: Mathematical Modelmentioning

confidence: 99%

See 1 more Smart Citation

Terminal allocation problem in a transshipment hub considering bunker consumption

Zhen

Wang

2016

Naval Research Logistics

View full text Add to dashboard Cite

This article investigates the method of allocating arriving vessels to the terminals in transshipment hubs. The terminal allocation decision faced by a shipping alliance has the influence on the scheduled arrival time of vessels and further affects the bunker consumption cost for the vessels. A model is formulated to minimize the bunker consumption cost as well as the transportation cost of inter-terminal transshipment flows/movements. The capacity limitation of the port resources such as quay cranes (QCs) and berths is taken into account. Besides the terminal allocation, the QC assignment decision is also incorporated in the proposed model. A local branching based method and a particle swarm optimization based method are developed to solve the model in large-scale problem instances. Numerical experiments are also conducted to validate the effectiveness of the proposed model, which can save around 14% of the cost when compared with the "First Come First Served" decision rule. Moreover, the proposed solution methods not only solve the proposed model within a reasonable computation time, but also obtain near-optimal results with about 0.1∼0.7% relative gap.

show abstract

Section: Pso Based Solution Methodsmentioning

confidence: 99%

Section: Mathematical Modelmentioning

confidence: 99%

Terminal allocation problem in a transshipment hub considering bunker consumption

Zhen

Wang

2016

Naval Research Logistics

View full text Add to dashboard Cite

show abstract

“…There are nonlinear terms in constraint (2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13)(14)(15)(16)(17), which computes the empty travel time of a YC, i.e., when it travels between the destinations of two inbound shipments. These terms can be linearized by introducing new binary variables of the form θ i,k,j,l to denote whether inbound shipments i, j ∈ C u are assigned to yards locations k, l ∈ L u .…”

Section: Constraintsmentioning

confidence: 99%

Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations

Kızılay

Eliiyi

Hentenryck

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper considers the integrated problem of quay crane assignment, quay crane scheduling, yard location assignment, and vehicle dispatching operations at a container terminal. The main objective is to minimize vessel turnover times and maximize the terminal throughput, which are key economic drivers in terminal operations. Due to their computational complexities, these problems are not optimized jointly in existing work. This paper revisits this limitation and proposes Mixed Integer Programming (MIP) and Constraint Programming (CP) models for the integrated problem, under some realistic assumptions. Experimental results show that the MIP formulation can only solve small instances, while the CP model finds optimal solutions in reasonable times for realistic instances derived from actual container terminal operations.

show abstract

“…He J et al [15] address the problem of integrated quay crane scheduling, internal truck scheduling, and yard crane scheduling. Tang L et al [16] address the joint quay crane and truck scheduling problem at a container terminal, considering the coordination of the two types of equipment to reduce their idle time between performing two successive tasks. Li W et al [17] develop an efficient continuous time MILP model for yard crane scheduling.…”

Section: Introductionmentioning

confidence: 99%

Optimization of Gantry Crane Scheduling in Container Sea-Rail Intermodal Transport Yard

Luo

Chang

Gao

2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In the face of rising container throughput and the tasks associated with collecting and dispatching these containers, contributions to the development of sea-rail intermodal transport are required to improve the capacity of container transportation. According to the characteristics and the requirements of the operation of sea-rail intermodal transport, this paper puts forward a design for the transport yard which facilitates container loading and unloading. Through the establishment of a mixed integer programming model, a flexible schedule for gantry crane operation can be realized, so that, during the planned period, the amount of task overflow in loading and unloading operations and the distance covered by all gantry cranes in the yard is minimized. In addition, a genetic algorithm is designed to solve this model. Finally, a specific example of the loading and unloading of a container train at the sea-rail intermodal transport yard is selected to verify the model and the algorithm. The results show that the algorithm can reasonably schedule the gantry cranes to improve their loading and unloading efficiencies in the sea-rail intermodal transport yard.

show abstract

Modeling and solution of the joint quay crane and truck scheduling problem

Cited by 103 publications

References 24 publications

Terminal allocation problem in a transshipment hub considering bunker consumption

Terminal allocation problem in a transshipment hub considering bunker consumption

Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations

Optimization of Gantry Crane Scheduling in Container Sea-Rail Intermodal Transport Yard

Contact Info

Product

Resources

About