论文部分内容阅读
现实物流活动中大量存在的易损、易碎物品的运输问题属于带二维装箱约束的物流配送问题,该问题是二维装箱问题与车辆路径问题这两个经典难题融合之后的一个新问题.针对这一问题,在对其进行明确定义的基础上,建立了数学模型,提出了解决该问题一个Memetic算法,对算法中的几个关键算子:深度优先的启发式装箱方法、染色体的编码方式及其路径分割程序、初始解的生成方法、交叉算子、局部搜索算子,进行了详细的阐述.通过初步的实验,确定了Memetic算法的最佳参数配置;然后在Iori提出的30个顾客数在20-199个标准算例上对算法的鲁棒性、求解的质量、以及求解性能等几项指标进行了测试,并与文献中的求解结果进行了比较.试验结果表明,该Memetic算法大大提高了现有算法的性能及求解结果的质量.
A large number of transport problems of fragile and fragile items in the real-world logistics activities belong to the logistics and distribution problem with two-dimensional packing constraints. This problem is a new one after two classical problems of two-dimensional packing and vehicle routing Problem.Aiming at this problem, on the basis of defining it clearly, a mathematical model is established and a Memetic algorithm is proposed to solve the problem. Several key operators in the algorithm are proposed: a depth-first heuristic boxing method, Chromosome encoding method and its path segmentation program, the initial solution generation method, crossover operator, local search operator, were described in detail.According to the preliminary experiment, the optimal parameter configuration of Memetic algorithm was determined. Then Iori The number of 30 customers in 20-199 standard examples on the algorithm’s robustness, the quality of the solution, as well as the performance of several indicators were tested and compared with the results of the literature were compared.The results show that The Memetic algorithm greatly improves the performance of the existing algorithms and the quality of the solution.