考虑不规则物流交互点的过道布置问题建模与优化

Modeling and optimization of corridor allocation problem considering irregular logistics interaction points

针对制造和服务系统中不规则物流交互点在过道布置问题中的研究不足,以实际布局方式为研究背景,探究物流交互点对过道布置问题(CAP)影响,构建考虑不规则末端设施物流交互点位置的CAP混合整数规划模型(MIP),同时结合问题和模型特点,提出一种基于遗传的混合鸡群算法,该算法采用整数编码方式,应用部分映射交叉、两点变异等操作进行离散化设计,结合所设定的代数参数G按照规则进行重新分组,通过对比5~49不同规模算例测试结果,验证了模型的合理性和算法的可行性。将所提算法与遗传算法、模拟退火算法、分散搜索算法在初始原过道布置问题上进行不同规模求解对比,结果表明了混合鸡群算法在求解效率和求解质量上的有效性和优越性。

Aiming at the lack of research on the corridor allocation problem of irregular logistics interaction points in manufacturing and service systems,the influence of the logistics'interacting point on Corridor Allocation Problem(CAP)was discussed by taking the actual layout mode as the research background.A CAP Mixed Integer Programming(MIP)model considering the location of irregular terminal facility logistics interaction points was constructed.At the same time,a mixed chicken swarm algorithm was proposed based on the characteristics of the problem and the model,which made discrete design with partial mapping crossover and two-point mutation operations by adopting integer coding.The set algebraic parameter G was regrouped according to the rules,and the rationality of the model and the feasibility of the algorithm were verified by comparing the test results of 5-49 different scale examples.By comparing the proposed algorithm with genetic algorithm,simulated annealing algorithm and decentralized search algorithm,the initial CAP was solved and compared on different scales.The results showed the effectiveness and superiority of hybrid chicken swarm algorithm in solving efficiency and quality.