基于最大最小蚁群算法的多卸载点车载装箱模型研究

Multi-Unloading Packing Problem Model Research Based on MMAS

针对多卸载点、多种货物、多车承运中的箱式货车装箱问题,为需要在不同地点卸货的货物生成货物装卸序列。建立了基于体积、重量和装卸距离的数学模型,定义了各类装箱约束条件,首先按照装箱规则和装箱约束生成一个可行解作为蚁群算法的初始解,再根据蚂蚁在货物上寻路的特点定义了信息素和选择概率公式,通过最大最小蚁群算法在一定的循环次数内求得最优解,从而达到最大化货车的装载利用率和体积利用率的目标。最后通过一个实例证明了该方法的合理性和有效性。

Aiming at the packing problems of container truck with multiple loading points,goods variety and multi-truck carriers,cargo loading and unloading sequence for different unloading locations was generated. Mathematical model was set up based on volume,weight and loading-unloading distance and the constraints to various packing types were defined. Firstly,a feasible solution generated as per packing rule and packing constraint served as initial solution by ant colony algorithm.Then,pheromone and selection probability formula was defined in accordance with characteristics of ants route seeking on goods to calculate the optimum solution within certain cycle numbers by max-min ant colony algorithm so as to achieve the goal of maximum loading utilization and maximum volume utilization of goods truck. Finally,the rationality and effectiveness of this method is justified by a practical case.