论文部分内容阅读
为提升集装箱运输系统的运输效率,以进口港口为背景,研究了多堆场集装箱卡车运输路径规划问题。通过图建模将问题转化为非对称多旅行商问题,建立了带时限约束的以最小化总工作时间为目标的线性混合整数规划数学模型。鉴于问题的复杂性,提出了给定序列的动态规划分割算法以及生成序列的改进蚁群算法,以此构造了求解该问题的混合蚁群算法。数值实验表明,混合蚁群算法在优化性能上明显优于禁忌算法和遗传算法,是求解该类问题的有效算法。
In order to improve the transportation efficiency of container transportation system, the paper studies the transportation planning of container trucks in multi-container yard with imported ports as the background. Through the graph modeling, the problem is transformed into the problem of asymmetric multi-traveling salesman, and a mathematical model of linear mixed integer programming with time-bound constraint is set up to minimize the total working time. In view of the complexity of the problem, a dynamic programming segmentation algorithm for a given sequence and an improved ant colony algorithm for generating a sequence are proposed, and a hybrid ant colony algorithm for solving this problem is constructed. Numerical experiments show that hybrid ant colony algorithm is better than tabu algorithm and genetic algorithm in optimization performance, which is an effective algorithm to solve this kind of problem.