高级检索

    许光泞, 俞金寿. 改进遗传算法求解三维集装箱装载问题[J]. 华东理工大学学报(自然科学版), 2007, (3): 425-428444.
    引用本文: 许光泞, 俞金寿. 改进遗传算法求解三维集装箱装载问题[J]. 华东理工大学学报(自然科学版), 2007, (3): 425-428444.
    XU Guang-ning, YU Jin-shou. An Improved Genetic Algorithm for Three-Dimension Container Loading Problem[J]. Journal of East China University of Science and Technology, 2007, (3): 425-428444.
    Citation: XU Guang-ning, YU Jin-shou. An Improved Genetic Algorithm for Three-Dimension Container Loading Problem[J]. Journal of East China University of Science and Technology, 2007, (3): 425-428444.

    改进遗传算法求解三维集装箱装载问题

    An Improved Genetic Algorithm for Three-Dimension Container Loading Problem

    • 摘要: 集装箱配载是一个复杂的组合优化问题,约束条件多,属于NP完全问题,求解难度大。本文在考虑一些实际应用中的约束条件下,提出了一种三维集装箱装载的改进遗传算法。算法中考虑了货物放置方向、装载容积等约束条件,给出了有效的解码算法。实例仿真结果说明了该算法的有效性和实用性,可以直接在实际中应用。

       

      Abstract: Container loading problem with multi-constraints is a complicatedly combinatorial optimization problem.It's a NP-hard problem and difficult to obtain an optimal solution.Considering many constraints in practical applications,an improved genetic algorithm for the three-dimension container loading problem is presented in this paper.In this algorithm,we take into account the direction in which goods are placed and the loading capacity,and propose an effective decoding algorithm.Simulation results show that the...

       

    /

    返回文章
    返回