两阶段混合布谷鸟算法求解双资源泊位分配

    Two-stage hybrid cuckoo search algorithm for solving the dual-resource berth allocation problem

    • 摘要: 针对航道整治等大型水上工程中施工船舶协同调度难题,首次将其建模为双资源泊位分配问题(DR-BAP),建立以最小化船舶等待成本和资源偏好不匹配成本为目标的数学模型。为求解此非确定性多项式(NP-hard)问题,提出两阶段混合布谷鸟搜索算法(TSH-CSA):第一阶段采用动态优先级、负载均衡引导策略及历史拥堵反馈惩罚机制进行宏观资源分配,融合领域知识与反馈信息优化适应度评估;第二阶段融合自适应双种群与智能重启机制实现微观精细化求解,算法整体构建“分配—调度—反馈”全局迭代框架以提升全局寻优能力。以某航道整治工程为背景的仿真实验表明,相较于标准布谷鸟搜索算法,TSH-CSA在求解质量、收敛速度与鲁棒性上均显著提升,验证了模型与算法解决复杂工程调度问题的有效性与先进性。

       

      Abstract: To address the challenge of coordinating and scheduling construction vessels in large-scale water projects such as waterway regulation,this problem is modeled for the first time as a Dual-Resource Berth Allocation Problem(DR-BAP). A mathematical model is established with the objective of minimizing vessel waiting costs and resource preference mismatch costs. To solve this Non-deterministic Polynomial-time hard(NP-hard) problem,a Two-Stage Hybrid Cuckoo Search Algorithm(TSH-CSA) is proposed. In the first stage,the algorithm employs dynamic priorities,a load balancing guidance strategy,and a historical congestion feedback penalty mechanism for macroscopic resource allocation. It integrates domain knowledge and feedback information to optimize fitness evaluation. In the second stage,the algorithm integrates an adaptive dual-population mechanism and an intelligent restart mechanism to achieve a microscopic,refined solution. Overall,the algorithm establishes a global iterative framework of "allocation-scheduling-feedback" to enhance its global optimization capability. Simulation experiments based on a waterway regulation project show that,compared with the standard Cuckoo Search Algorithm,TSH-CSA exhibits significant improvements in solution quality,convergence speed,and robustness.These results verify the effectiveness and advancement of the proposed model and algorithm in solving complex engineering scheduling problems.

       

    /

    返回文章
    返回