排序方式: 共有5条查询结果,搜索用时 0 毫秒
1
1.
2.
在集卡提箱预约中,集装箱码头场桥配置和预约配额的联合优化是缩短集卡等待时间,提升资源利用率的关键. 针对提箱作业的实际特点,构建了双目标整数规划模型,设计了基于非支配排序遗传算法的求解方法. 当码头需求较少时,采取动态调整随机分配场桥最佳;当码头需求较高时,采取动态调整与按需配置相组合的方式最佳. 以国内某码头为原型,通过不同规模的算例实验,验证了模型和算法的有效性. 所提方法可快速生成高质量、多样化的前沿解,实现了场桥资源与集卡作业需求的匹配优化,为码头管理者在资源投入与集卡等待时间的权衡中,提供了决策支持. 相似文献
3.
在集卡提箱预约中,集装箱码头场桥配置和预约配额的联合优化是缩短集卡等待时间,提升资源利用率的关键. 针对提箱作业的实际特点,构建了双目标整数规划模型,设计了基于非支配排序遗传算法的求解方法. 当码头需求较少时,采取动态调整随机分配场桥最佳;当码头需求较高时,采取动态调整与按需配置相组合的方式最佳. 以国内某码头为原型,通过不同规模的算例实验,验证了模型和算法的有效性. 所提方法可快速生成高质量、多样化的前沿解,实现了场桥资源与集卡作业需求的匹配优化,为码头管理者在资源投入与集卡等待时间的权衡中,提供了决策支持. 相似文献
4.
针对带时间窗的甩挂运输路径优化问题,考虑整车和卡车2种运输方式,以及整车、卡车、混合3种行驶路径,以行驶时间为目标函数构建模型,设计基于A、B策略的两阶段混合启发式算法.算例分析结果表明:针对客户规模在100以内的小规模算例,均可在3s内求得结果,策略B的求解时间少于策略A,而策略A的目标函数优于策略B;当客户规模逐步增至900时,选择策略A可获得更高的求解效率.可见,本文所构建的模型与算法是可行和有效的,对实际配送过程中的车辆指派与路径优化具有一定的参考价值. 相似文献
5.
Arranging the retrieving sequence and making the operational plans for gantry cranes to enhance port efficiency have become vital issues for the container terminals. In this paper, the problem of retrieving containers from a yard in a given sequence is discussed as an important part of the ship-loading process. This problem is divided into three categories according to its optimization complexity, i.e., the retrieval problem of a crane with a single spreader (ACSS), the retrieval problem of a crane with multiple spreaders (ACMS), and the retrieval problem of multiple cranes with a single spreader (MCSS). Firstly, heuristic algorithms are proposed to develop a retrieving sequence for ACSS to reduce the operational time. Then, optimizing the assignment to multiple spreaders is conducted by exchanging the movements of the obtained retrieving sequence. Finally, the movements are further assigned to two cranes and integrated with the MCSS retrieval problem mentioned above. The numerical experiments show the effectiveness and practicability of the heuristic algorithms. 相似文献
1