The rapid development of e-commerce warehousing has put forward higher requirements for the task scheduling and allocation of multi-picking robots,and the qualitative description of the colored travel salesman problem in urban tasks has gradually failed to meet the needs of quantitative analysis in actual problems.To reduce the comprehensive cost and improve the picking efficiency,it is proposed to propose a capacitated colored travel salesman problem based on the colored travel salesman problem combined with the capacitated vehicle routing problem to better construct the schedul-ing model of the multi-picking robot with the goal of minimizing the total path cost,and design the corresponding variable neighborhood search algorithm to solve the model.Experimental results show that compared with the genetic algorithm and its improved algorithm,the variable neighborhood search algorithm is superior in solving the problem of capacitated colored travel salesman problem,and the model and its solving algorithm have certain practical value.
万方数据
维普
