面向智能车间的动态过道布置问题建模与优化OA北大核心CSTPCD

Aiming at the shortcomings of traditional corridor allocation that rarely consider the need to respond quickly to changes in production demand and the flexibility of product mix during processing,a dual objective dynamic corridor allocation problem was constructed.By adjusting the location of facilities at different stages,the sum of material handling cost and facility restructuring cost and layout area were minimized.Since the dual objective corridor allocation problem is characterized as non-deterministic polynomial(NP)-hard problem,a multi-objective improved cat swarm algorithm based on Pareto dominance was also proposed.First,the basic cat swarm optimization was discretized,the Pareto dominance idea and crowding distance mechanism were introduced to process the two-target results,and the variable neighborhood search structure was embedded to speed up the optimization of the algorithm.Finally,the proposed algorithm was used to test a large number of examples of different scales,and the results were compared with other algorithms to verify the effectiveness and superiority of the algorithm.