In order to promote the efficient and intelligent construction of container ports, we focus on the optimization of berth-and-quay-crane (QC) allocation in tidal terminal operations. This paper investigates the quay-crane-profile-(QC-profile)-based assignment problem, and considers the uncertainty in QC profiles regarding QC efficiency for the first time. A mixed-integer programming (MIP) model is established for a discrete berth allocation with a crane-assignment problem (BACAP), considering the tide time window. We aim to minimize the total time loss caused by anchorage and the delay of vessels. Leveraging the theory of uncertainty optimization, the proposed deterministic model is extended into a stochastic programming (SP) model and a distributionally robust optimization (DRO) model, via the consideration of the random QC efficiency. To solve the proposed models, a column generation (CG) algorithm is employed, utilizing the mathematical method and subproblem-solving approach. The numerical experiments with different instances demonstrate that the DRO model yields a smaller variation in the objective function values, and the effectiveness of the CG method. The experimental results verify the robustness of the constructed models, and the efficiency of the proposed algorithm.
In order to mitigate the environmental pollution caused by sea freight, we focused on optimizing carbon emissions in container terminal operations. This paper establishes a mixed integer programming (MIP) model for a continuous berth allocation problem (CBAP) considering the tide time window. We aimed to minimize the total carbon emissions caused by the waiting time, consumption time and deviation to berth preference. In order to overcome the influence of an uncertain arrival time, the proposed MIP model was extended to mixed integer robust programming (MIRP) models, which applied a two-stage robust optimization (TSRO) approach to the optimal solution. We introduced an uncertainty set and scenarios to describe the uncertain arrival time. Due to the complexity of the resulting models, we proposed three particle swarm optimization (PSO) algorithms and made two novelties. The numerical experiment revealed that the robust models yielded a smaller variation in the objective function values, and the improved algorithms demonstrated a shorter solution time in solving the optimization problem. The results show the robustness of the constructed models and the efficiency of the proposed algorithms.
Based on comparative studies on correlation coefficient theory and utility theory, a series of rules that utility functions on dual hesitant fuzzy rough sets (DHFRSs) should satisfy, and a kind of novel utility function on DHFRSs are proposed. The characteristic of the introduced utility function is a parameter, which is determined by decision-makers according to their experiences. By using the proposed utility function on DHFRSs, a novel dual hesitant fuzzy rough pattern recognition method is also proposed. Furthermore, this study also points out that the classical dual tool is suitable to cope with dynamic data in exploratory data analysis situations, while the newly proposed one is suitable to cope with static data in confirmatory data analysis situations. Finally, a medical diagnosis and a traffic engineering example are introduced to reveal the effectiveness of the newly proposed utility functions on DHFRSs.