摘要
针对现存拆卸路径规划图论方法中的组合爆炸问题和遗传算法的早熟现象,给出模拟退火和遗传算法相结合的拆卸路径规划方法。在拆卸路径规划模型中,以拆卸效率最优作为优化目标,给出了算法流程。该算法对拆卸路径的全面寻优提供了一种新的思路。通过实例验证该算法的可行性,最后提出了进一步的研究方向。
To deal with the problems of the combination explode in the graph theory and the premature phenomena in the Genetic Algorithm（GA） in the existing Disassembly Sequence Planning（DSP）. A new DSP method named simulated annealing and genetic algorithm（SAGA） to combine the simulated annealing（SA） and genetic algorithm（GA） is presented. In the DSP model,the disassembly efficiency is used as objective function and the flow chart of the algorithm is presented. This algorithm provides a new way for the overall searching for the optimal disassembly sequences. Finally a case study is given to validate the feasibility of the algorithm and the further research on this algorithm of the DSP is also presented.
出处
《机械工程师》
2007年第1期103-105,共3页
Mechanical Engineer
基金
广西教育厅资助项目(D200324)
