| 动态规划粒子群算法解PCB数控钻孔最佳走刀路线问题 |
| |
| 引用本文： | 莫愿斌,陈德钊,胡上序.动态规划粒子群算法解PCB数控钻孔最佳走刀路线问题[J].机床与液压,2006(8):18-21. |
| |
| 作者姓名： | 莫愿斌 陈德钊 胡上序 |
| |
| 作者单位： | 1. 浙江大学智能信息工程研究所,浙江杭州,310027;中国计量学院,浙江杭州,310018
2. 浙江大学智能信息工程研究所,浙江杭州,310027 |
| |
| 摘 要： | 设计印刷电路板（PCB）数控钻的走刀路线是数控钻编程的重要组成部分，目前自动编程系统生成的钻孔路线未必是最佳走刀路线。本文在粒子群算法的基础上提出动态规划粒子群算法，并用此方法求解PCB的最佳走刀路线，获得了满意的结果。
|
| 关 键 词： | 动态规划 粒子群优化算法 印刷电路板 最佳走刀路线 旅行商问题 |
| 文章编号： | 1001-3881(2006)8-018-4 |
| 收稿时间： | 2005-06-24 |
| 修稿时间： | 2005年6月24日 |
Dynamic Programming Particle Swarm Optimization Algorithm for Solving Optimal Moving Path for PCB MO |
| |
| Yuanbin,CHEN Dezhao,HU Shangxu.Dynamic Programming Particle Swarm Optimization Algorithm for Solving Optimal Moving Path for PCB MO[J].Machine Tool & Hydraulics,2006(8):18-21. |
| |
| Authors: | Yuanbin CHEN Dezhao HU Shangxu |
| |
| Affiliation: | 1. Institue of Intelligent Information Engineering, Zhejiang University, Hangzhou Zhejiang 310027, China; 2. China Jiliang University, Hangzhou Zhejiang 310018, China |
| |
| Abstract: | It is important for printed circuit boards(PCB) programming system to find out the optimal moving path,but up to now,the drilling path,which was automatically generated by programming system for PCB,is not necessarily optimal.An algorithm was proposed by combination the dynamic programming and particle swarm optimization(PSO) for the problems of optimal moving path for PCB.The experiments results demonstrate the effectiveness and efficiency of the algorithm. |
| |
| Keywords: | Dynamic programming Particle swarm optimization olgorithm Printed circuit boards Optimal moving path Traveling salesman problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
