Smarter Crane Scheduling Could Cut Port Energy Use Without Slowing Cargo

Every time a giant yard crane at a container terminal lurches into motion, it burns a noticeable surge of electricity. Those repeated gantry startups, along with the empty and loaded travels of the crane between stacks of shipping containers, add up to a substantial share of a terminal’s energy bill. Yet most scheduling research has focused almost exclusively on speed: how to move containers as quickly as possible, with energy treated as an afterthought. A new study published in Applied Intelligence argues that this narrow focus leaves both money and carbon savings on the table, and it proposes an intelligent optimization framework that tackles efficiency and energy consumption simultaneously rather than treating them as competing afterthoughts.

The research, led by Rui Hu, Xuan He, and Hongtao Hu of Shanghai Maritime University, together with Jiangang Jin of Shanghai Jiao Tong University and Yan Liang of Shanghai Zhenhua Heavy Industries, addresses a deceptively tangled decision problem at the heart of port logistics. In a container yard, rubber-tired or rail-mounted gantry cranes pick up and drop off containers while yard vehicles wait at designated parking positions alongside the container blocks. Where a vehicle parks determines how far the crane must travel to reach it. The crane’s sequence of jobs, in turn, determines when each vehicle is needed and where it should wait. Because these two decisions feed back into each other, they cannot be optimized sensibly in isolation, and the combined problem grows combinatorially explosive as the number of containers, vehicles, and cranes increases.

What sets this work apart from earlier scheduling studies is its explicit treatment of gantry startup energy. Each time a crane begins a new gantry movement, accelerating its massive frame from rest, it consumes a discrete burst of power that is disproportionately large compared with steady-state travel. The authors formulate a mixed-integer linear programming model that captures three distinct sources of energy use: the startup events themselves, the crane’s empty travel between jobs, and its loaded travel while carrying a container. By encoding these components directly into the mathematical model, the framework can reason about trade-offs that cruder models miss entirely, such as accepting a slightly longer empty move to avoid triggering an additional startup.

The optimization pursues two objectives at once: minimizing the makespan, meaning the total time to complete all assigned container handling jobs, and minimizing total gantry energy consumption. These goals genuinely conflict. A schedule that rushes through every job in the shortest possible time may force the crane into many extra repositioning moves and repeated startups, inflating energy use. An energy-thrifty schedule that clusters jobs to minimize crane movement may leave vehicles idling and stretch the overall completion time. Rather than collapsing the two objectives into a single weighted score, which would hide the shape of the trade-off, the researchers treat the problem as bi-objective and seek a set of Pareto-optimal solutions representing the best achievable compromises.

Solving such a problem exactly is impractical at realistic scale, so the team developed an improved version of the non-dominated sorting genetic algorithm II, or NSGA-II, a widely used evolutionary method for multi-objective optimization originally introduced by Deb and colleagues in 2002. Genetic algorithms maintain a population of candidate schedules and iteratively breed, mutate, and select them, with non-dominated sorting ensuring that the population spreads across the full trade-off frontier rather than converging on a single point. But a generic implementation struggles with the specific structure of crane-and-vehicle scheduling, so the authors embedded several problem-aware strategies into the algorithm’s machinery.

The first strategy concerns how the population is initialized. Instead of generating random schedules, the improved algorithm employs a parking-slot allocation heuristic that constructs high-quality starting solutions by assigning vehicles to parking positions in a way that anticipates the crane’s workload. Good initialization matters enormously in evolutionary computation: a population that already respects the problem’s constraints and near-optimal structure gives the search a running start and prevents generations from being wasted on obviously poor schedules. The heuristic effectively seeds the algorithm with solutions that a human dispatcher might spend hours crafting by trial and error.

Second, the researchers designed neighborhood search operators tailored to the physics of crane operation. These operators make targeted local modifications to a schedule, such as reordering jobs or shifting a vehicle’s parking slot, specifically to eliminate unnecessary crane movements and reduce the number of gantry startup events. Because the operators encode domain knowledge about which changes are likely to help, they refine solutions far more efficiently than random mutation. Third, the algorithm incorporates a destruction-reconstruction local search mechanism, in which part of a promising solution is deliberately dismantled and rebuilt in a different way. This aggressive intensification step pushes the search deeper into high-quality regions of the solution space while the rebuilding randomness helps it escape local optima, the deceptive peaks where simpler search methods tend to get trapped.

Numerical experiments built on realistic terminal operation scenarios put the framework to the test. The results showed that the improved algorithm produces high-quality trade-off solutions, achieving significant reductions in energy consumption while maintaining operational efficiency, according to the study. In practical terms, the approach gives terminal operators a menu of schedules rather than a single prescription: one end of the frontier favors the fastest possible completion, the other favors the leanest energy footprint, and intermediate points quantify exactly how much time must be sacrificed to save a given amount of energy. That kind of explicit quantification is precisely what decision makers need when terminals face both tight vessel departure windows and mounting pressure to cut emissions.

The significance of the work extends beyond the container yard. Ports are under intensifying scrutiny for their environmental impact, and yard equipment represents one of the largest controllable energy loads in terminal operations. Previous studies have integrated energy considerations into port equipment scheduling, but the authors note that the energy cost of gantry startups has received relatively limited attention despite its magnitude. By proving that startup-aware scheduling can be solved effectively with evolutionary computing, the study opens a path for terminals to retrofit their dispatch software with energy intelligence without replacing hardware. The savings would compound across thousands of daily crane cycles at a major terminal.

More broadly, the research is a case study in how hybrid intelligence, combining evolutionary search with heuristic and local-search techniques, can crack industrial scheduling problems that defeat both pure mathematical programming and off-the-shelf metaheuristics. The authors describe their results as confirming the effectiveness of integrating evolutionary computing and heuristic search for intelligent decision support in complex industrial scheduling systems. As automation spreads through global supply chains, from automated guided vehicles to twin stacking cranes, the lesson is that the smartest systems will be those that understand the machinery they orchestrate, down to the energy spike of a single gantry startup, and that treat speed and sustainability not as rivals to be traded blindly but as dimensions to be balanced with mathematical precision.

Subject of Research: Bi-objective optimization of integrated yard crane scheduling and vehicle positioning considering gantry startup energy consumption at container terminals

Article Title: Integrated yard crane scheduling and vehicle positioning considering gantry startup and energy consumption

Article References: Hu, R., He, X., Hu, H., Jin, J., & Liang, Y. (2026). Integrated yard crane scheduling and vehicle positioning considering gantry startup and energy consumption. Applied Intelligence, 56(14), Article 415. https://doi.org/10.1007/s10489-026-07463-z

Image Credits: AI Generated

DOI: 10.1007/s10489-026-07463-z

Keywords: yard crane scheduling, container terminals, energy consumption, gantry startup, vehicle positioning, NSGA-II, bi-objective optimization, evolutionary algorithm, mixed-integer programming, port logistics, heuristic search, makespan