Ship traffic optimization method for solving the approach channel and lock co-scheduling problem of the Three Gorges Dam on the Yangzi River

Zheng, Qianqian; He, Lijun; Hong-wei, Tian

doi:10.1016/j.oceaneng.2023.114196

Cited by 20 publications

(8 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nonetheless, when dealing with larger problem scales or increasingly complex structures, the solution performance of the CP solver exhibits gradual deterioration. Recognizing the inclination of heuristic and meta-heuristic algorithms to become ensnared within local optima when addressing intricate optimization challenges [35,36], this research offers a comprehensive explanation on the configuration of CP solver parameters and strategic solutions to enhance its efficiency. Additionally, it introduces an enhanced twostage solution algorithm that amalgamates ALS, SA, and the CP solver, with the specific aim of avoiding such suboptimal solutions.…”

Section: The Methodology: Heuristic Strategies To Improve the Solutionmentioning

confidence: 99%

Integrated Inbound and Outbound Scheduling for Coal Port: Constraint Programming and Adaptive Local Search

Lu,

Zhang,

Zheng

et al. 2024

JMSE

Self Cite

View full text Add to dashboard Cite

The effective production scheduling of dry bulk ports is a challenging task that demands meticulous planning, task allocation based on customer requirements, as well as strategic route and timing scheduling. Dry bulk ports dedicated to handling commodities like coal and iron ore frequently engage in blending operations as a strategic imperative to gain market competitiveness. The process of blending coal and ore entails the timely arrival of the requisite raw materials at predetermined locations. Simultaneously, it necessitates the coordination of the sequencing of goods entering and departing the port to align with the operational demands associated with material stockpiles. This paper describes and analyzes an operational scheduling problem encountered by one of the largest coal blending sea ports in China. Specifically, a rich constraint programming model is presented to define operation sequences integrating daily inbound and outbound services provided by the port, minimizing the overall operation time. In order to enhance the practicality of the method, a CP-based adaptive simulated annealing local search algorithm has been designed and developed for the optimization problem. The empirical validation of the proposed method is conducted using both real production data and generated experimental data adhering to specific rules. The results conclusively demonstrate the efficacy and feasibility of the proposed method. This also substantiates its practicality and effectiveness in real-world applications, facilitating efficient production and energy-saving operations for the coal port.

show abstract

Section: The Methodology: Heuristic Strategies To Improve the Solutionmentioning

confidence: 99%

Integrated Inbound and Outbound Scheduling for Coal Port: Constraint Programming and Adaptive Local Search

Lu,

Zhang,

Zheng

et al. 2024

JMSE

Self Cite

View full text Add to dashboard Cite

show abstract

“…When sailing, a ship encounters resistance R proportional to the square of its speed v 2 . Accordingly, the power required (denoted by P) can be expressed as the product of the resistance, i.e., P(v) = R(v)v. Subsequently, from the fact that fuel consumption per unit of time is proportional to the power required, the formula for fuel consumption per unit of ship can be derived as F(v) = αv 3 , where α represents the ship's fuel consumption coefficient. Furthermore, considering that the time required for a ship to sail a distance D is t = D/v, we can derive the fuel consumption for sailing a distance D as F(v, D) = αDv 2 .…”

Section: Optimization Objectivesmentioning

confidence: 99%

“…In the process of ship navigation, there are many bottlenecks, such as channel navigation problems before entering container ports [1,2], dams [3,4], and canals [5,6] in inland waterway navigation. Locks, as important components in inland waterway transportation, are also one of the major bottlenecks in the navigation process of inland waterway transportation.…”

Section: Introductionmentioning

confidence: 99%

“…Yuan et al [18] divided the TGD lock scheduling into three subproblems: lock allocation, schedule optimization, and the ship scheduling problem, and proposed a chaotic embedded particle swarm optimization algorithm to solve it. Zhang et al [3] proposed a multi-objective mathematical model for optimizing lock utilization, the average waiting time, and ship energy consumption in the joint scheduling problem of the TGD. They introduced a multi-objective metaheuristic algorithm (MOMA) based on fuzzy correlation entropy for solving it.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Modeling and Solution Algorithm for Green Lock Scheduling Problem on Inland Waterways

Wu,

Ji,

2024

Mathematics

View full text Add to dashboard Cite

Inland navigation serves as a vital component of transportation, boasting benefits such as ample capacity and minimal energy consumption. However, it also poses challenges related to achieving navigation efficiency and environmental friendliness. Locks, which are essential for inland waterways, often cause ship passage bottlenecks. This paper focuses on a green lock scheduling problem (GLSP), aiming to minimize fuel emissions and maximize navigation efficiency. Considering the realistic constraints, a mixed-integer linear programming model and a large neighborhood search solution algorithm are proposed. From a job shop scheduling perspective, the problem is decomposed into three main components: ship-lockage assignment, ship placement subproblem, and lockage scheduling subproblem coupled with ship speed optimization. A large neighborhood search algorithm based on a decomposition framework (LNSDF) is proposed to tackle the GLSP. In this, the complex lockage scheduling problem is addressed efficiently by mapping it to a network planning problem and applying the critical path method. Numerical experiments substantiate the effectiveness of our proposed model and a heuristic approach was used in solving the GLSPs. In the sensitivity analysis, under three different objective weight assignments, the resulting solutions achieved average effective ship fuel savings of 4.51%, 8.86%, and 2.46%, respectively. This indicates that our green lock scheduling problem considering ship speed optimization can enhance ship passage efficiency while reducing carbon emissions.

show abstract

“…In addition to the waterway, other seaside operation resources have also received some attention, e.g., berth allocation [19,20], ship lock scheduling [21,22], quay crane scheduling [23,24], and so on. Roughly speaking, these resources are closely related to ships entering and leaving a port, where the turning basin is also a necessary water area.…”

Section: Introductionmentioning

confidence: 99%

Departure Vessel Scheduling Optimization Considering Traffic Restrictions in Turning Basin: A Case Study for Xuwen Terminal

Jia

2023

JMSE

View full text Add to dashboard Cite

As the largest modern passenger Roll-on Roll-off (RoRo) terminal around the world, the berthing operation of Xuwen terminal is occasionally suspended due to bad weather, such as strong wind or thick fog. During the suspension, the number of stranded passengers and vehicles increasingly accumulates. As soon as the weather permits, the growth exerts great pressure, especially on large-scale vessels leaving the port, whose inefficiency may cause a loss of access to the terminal for inbound ships and chaos for port management. The focus of this study is to improve the efficiency of departure scheduling by optimizing traffic rules in the harbor basin. A mathematical optimization model is formulated for minimizing the total scheduling time, and then an adaptive simulated annealing (ASA) algorithm is proposed to solve the model. A specific decoding rule is introduced, referring to the characteristics of the mentioned model. After employing the operation data of the Xuwen terminal, a numerical experiment showed that the proposed scheduling method outperformed the first-come, first-served (FCFS) strategy and an improved ant colony algorithm (ACA). Moreover, the constructed simulation model of the terminal manifested the validity of the optimal solution.

show abstract

Ship traffic optimization method for solving the approach channel and lock co-scheduling problem of the Three Gorges Dam on the Yangzi River

Cited by 20 publications

References 41 publications

Integrated Inbound and Outbound Scheduling for Coal Port: Constraint Programming and Adaptive Local Search

Integrated Inbound and Outbound Scheduling for Coal Port: Constraint Programming and Adaptive Local Search

Modeling and Solution Algorithm for Green Lock Scheduling Problem on Inland Waterways

Departure Vessel Scheduling Optimization Considering Traffic Restrictions in Turning Basin: A Case Study for Xuwen Terminal

Contact Info

Product

Resources

About