Integration of process planning and scheduling using chaotic particle swarm optimization algorithm
详细信息    查看全文
文摘

Chaotic PSO algorithm is proposed to solve NP-hard IPPS problem.

Ten chaotic maps are implemented to avoid premature convergence to local optimum.

Makespan, balanced level of machine utilization and mean flow time are observed.

Five experimental studies show that cPSO outperforms GA, SA, and hybrid algorithm.

Scheduling plans are tested by mobile robot within a laboratory environment.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700