Search

This paper integrates, from a tactical perspective, berth allocation and quay-crane assignment, two important, closely related decisions in container terminal operations in a single model. To obtain optimal solutions, a branch-and-price algorithm is sought in this paper under the framework of Dantzig–Wolfe decomposition. The algorithm decomposes the original problem to a master problem that links all vessels competing for the shared resources of berths and quay cranes and multiple per-vessel pricing subproblems that can be solved efficiently in polynomial time. Specifically, in the stage of generating promising initial feasible columns, three heuristics are adopted; during the column-updating stage, the subgradient-based Lagrangian relaxation is introduced to tackle the possibly encountered degeneracy phenomenon; the branching strategy is implemented in the pricing subproblem rather than in the master problem as reported in the literature with the benefit of avoiding incurring new dual prices, simplifying the branching process; and both breadth- and depth-first searching policies are tested to select the next node to explore. With real-life data, extensive numerical experiments are conducted to select the best choice for each stage with the strengths and drawbacks of each choice provided. And then the superiority of the branch-and-price algorithm configured with the selected combination of strategies is verified by comparing it with both CPLEX, a general-purpose solver, and a set-partitioning model, a dedicated algorithm reported in the literature. In addition, the decomposition by vessels adopted in this paper is also verified numerically by comparing it with the decomposition by berths reported in the literature, and the performance of the algorithm for other problem settings has also been tested. In conclusion, the numerical experiments show that our method outperforms the commercial solver and state-of-the-art solution methods reported in the literature in terms of both solution quality and computational time. [ABSTRACT FROM AUTHOR]

Airport runway assignment and gate assignment are both crucial problems for large multirunway airports. A cooperative schedule for the runway and gate can have a significant effect on airport ground operation efficiency and safety. This paper focuses on the joint assignment problem of runways and gates considering parking time differences and airline preferences. A quadratic model is established to reduce taxiing fuel consumption loss and increase the robustness of gate assignment. An improved branch-and-price algorithm is proposed by utilizing an improved pulse algorithm and various acceleration strategies to improve the solution performance. The actual flight data at an international hub airport are utilized to validate the proposed model. The results indicate that the joint assignment model can effectively reduce ground taxiing loss, optimize gate assignment robustness, and increase the utilization rate of contact gates. The proposed algorithm also achieves better computational accuracy and efficiency. • Proposed joint runway–gate assignment model can reduce the taxiing loss and gate robustness loss. • The model optimizes the taxiing and gate robustness while ensuring airline's preference. • A better solution is obtained by an improved branch-and-price method. • Experiments are designed to verify the value of the joint model. [ABSTRACT FROM AUTHOR]