基于混合蚁群算法的箱装农产品单车装载研究

目的提出一种求解考虑包装特点的箱装农产品单车装载优化问题的有效算法。方法针对箱装农产品单车装载中的弱异类货物问题,以容积利用率最优为目标构建装载数学模型;分析农产品成箱包装的特点,并重新描述了货物承重约束和方向约束;针对模型求解提出了一种混合蚁群算法,包括基于砌墙式的启发装载策略,以及改进后的期望函数;最后选取了5组标准数据,构造了1组农产品数据,设置了3套实验方案对算法进行验证。结果实验1中算法较2种比对算法目标值分别高出3%和2.5%;实验2,算法平均体积利用率达到81.59%;实验3,改变初始参数后算法最大目标值为93.9%。结论提出的算法求解单车弱异类货物装载问题有效且性能良好;算法用于求解考虑包装特点的箱装农产品单车装载问题,具有一定的可行性。

Single Truck Loading of Case Packed Agricultural Products Based on Hybrid Ant Colony Algorithm

The paper aims to propose an effective algorithm on optimization of single truck loading of box packed ag-ricultural products which considering packaging characteristics. Aiming at the problem of weak heterogeneous goods in single truck load of packaged agricultural products, the mathematical model of loading was established with the goal of optimal volume utilization ratio. The characteristics of agricultural products packed in boxes were analyzed. Cargo load-bearing and directional constraints were re-described. A hybrid ant colony algorithm was proposed for solving the model, including the heuristic loading strategy based on the wall, and the improved expectation function. Finally, five sets of standard data and one set of agricultural product data were selected, and three experimental schemes were set up to verify the algorithm. In experiment 1, the target value of the algorithm was 3% and 2.5% higher than that of the two algorithms. In experiment 2, the average volume utilization rate of the algorithm reached 81.59%. In experiment 3, the maximum target value of the algorithm was 93.9% after changing the initial parameters. The algorithm is effective and has good performance in solving the loading problem of single weak heterogeneous cargo. It is feasible to use the algorithm to solve the single truck load problem of case packed agricultural products considering the packaging characteristics.