With the rapid development of new technology and the increase of labor cost, unmanned warehouse has gradually become the development trend and overall goal of automated warehouse logistics management system. In the technical specification of unmanned warehouse, the production scheduling problem of AGV logistics robot is the main problem in the technical specification. In this competition, everyone relatively restored the application field in the unmanned warehouse, allowing students to design and complete the work assignment, regional planning and the shortest path algorithm of intelligent robots according to the algorithm, so as to carry out mechanical automation.
The best countermeasure of AGV integrated production scheduling
Without considering the collision problem that may occur when intelligent robots perform tasks, an optimization algorithm of production scheduling without physical model of artificial warehouse is designed. According to the data information of the orders in the accessories (orders.csv) and the data information of the inventory in the warehouse (pallets.csv), the daily tasks of the given 20 logistics robots (agv.csv) are comprehensively scheduled and assigned until all customer orders are met, that is, all the picking processes are completed.
Question 2: Regional planning of daily task balance
In order to better balance the load in the picking process and prevent the local congestion of logistics robots, the warehouse topographic map is dynamically partitioned according to the picking process and the total number of finished products. In other words, for each pallet in the warehouse, a default picking process is specified. Please create an optimization model to make the total product output of each picking process as average as possible, and specify the total distance between all pallets and their default picking processes.
Question 3: Prevent collision and congestion.
On the basis of question 1 and question 2, the collision and congestion of logistics robots are further considered. When there are multiple AGVs performing tasks at the same time in the warehouse, it is difficult to avoid some AGVs meeting at a certain connection point. In particular, if two AGVs meet in the narrow aisle of the shelf, they must hide in one of them. Under the effective assumption, please design the scheme optimization algorithm and anti-collision countermeasures to make the logistics robot avoid collision automatically. At some unique connection points in the city square (such as trailer recycling place), prevent the congestion of multiple AGVs and possible deadlock scenes.
Coap (center for the optimization of rational gorithm platform) is a comprehensive service platform for the public based on ant colony algorithm. Founded by Shanghai University of Finance and Economics and Shanshan Technology, it is committed to bringing completely free computer applications and econometric problems to the public. At present, the lowest layer has integrated more than 5+ solver modules such as CBC, CLP and COPT, which are suitable for multi-client and multi-task with high concurrency. In the future, the popular solver modules of global commercial and open source systems will be gradually integrated to help solve the optimization problems from global industry, academia and administrative institutions, improve the mathematics classroom in China, and upgrade the green ecological community and mobile phone software infrastructure.