Container loading method based on improved ant colony algorithm and heuristic algorithm

Abstract

The invention discloses a container goods placing method based on an improved ant colony algorithm and a heuristic algorithm. The method comprises the following steps that information of goods to be loaded and container space information are initialized; an ant colony, goods loading chain information of each ant and pheromone information are initialized; goods selection probability is generated by a current ant according to the iterations of a current ant colony algorithm and the maximum iteration, and a heuristic goods selection mode or an ant colony goods selection mode is chosen according to a roulette mode; if the heuristic mode is chosen, goods loaded on the left and the rear of the current space and the current space to be loaded are taken into consideration, and proper goods are selected from selected goods to be loaded and are loaded in a recursion mode; if the ant colony goods selection mode is chosen, a pheromone matrix is inquired, and goods are loaded in the roulette mode; the optimal placing posture of the chosen goods is chosen in a backtracking mode.

Description

Technical field [0001] The invention relates to a method for placing goods in a container, in particular to a method for placing goods in a container combining a heuristic algorithm and an improved ant colony algorithm. Involving patent classification number B65 transportation; packaging; storage; transporting thin or filamentary materials B65G transportation or storage devices, such as loading or tilting conveyors; workshop conveyor systems; pneumatic pipeline conveyors B65G65 / 00 loading or unloading B65G65 / 30 Methods or devices for filling or emptying silos, hoppers, tanks or similar containers, excluding the use of these methods or devices in special chemical or physical processes or the application of special machinery, such as not included in other In a single subcategory. Background technique [0002] The container layout optimization problem is a three-dimensional combinatorial optimization problem with complex constraints. In theory, it is an NP complete problem, and it...

AI Technical Summary

Problems solved by technology

[0002] The container layout optimization problem is a three-dimensional combinatorial optimization problem with complex constraints. It is theoretically an NP-complete problem, and it is impossible to obtain the optimal solution in a limited time.

[0004] However, with the increase of the scale of the problem and the requirements for the running time of the algorithm in practical applications, it is difficult for a single algorithm to meet the requirements of practical applications.

It takes a long time for a single intelligent algorithm to converge to the optimal solution, but the heuristic algorithm can quickly get the solution, but the quality of the solution is not satisfactory

Images