种求解多目标柔性作业车间调度地改进粒子群算法.docVIP

PAGE PAGE 10 收稿日期:2009-10-19 基金项目：教育部霍英东教育基金青年教师基金项目(111056). 新世纪优秀人才支持计划资助项目(NCET-08). 一种求解多目标柔性作业车间调度的改进粒子群算法 白俊杰 王宁生 唐敦兵 （南京航空航天大学 CMS工程研究中心 江苏 南京 210016） 摘要：针对具有高纬搜索空间的多目标柔性作业车间调度问题，提出了一种基于偏好的多目标粒子群优化算法（PMOPSO）。算法引入了决策者的偏好信息，用以指导算法的搜索过程，使算法在决策者感兴趣的区域进行搜索，不但缩小了算法的搜索空间，提高了算法的效率，而且一次运算只求得偏好区域内若干个折中解，避免了决策者要在众多非劣解中做出困难的选择。在算法中，采用了新的偏好信息给定方法，即采用目标间重要关系、目标数值或目标权重大致取值范围来表示偏好信息。采用该方法，不但便于决策者给定偏好信息，而且还可以根据决策者的需求，对搜索区域的范围进行适当的调整。针对偏好信息的特点，提出了一种模拟人类社会组织“投票选举”的偏好信息处理方法，该方法直观简便并易于实现。最后，通过实例仿真，对算法性能进行比较分析和评价，结果表明了算法的有效性和可行性。 关键词：柔性作业车间调度；粒子群优化算法；多目标优化；偏好信息 中图分类号：TH16；TP278 文献标识码：A Improved PSO Algorithm for the Multi-Objective Optimization Flexible Job Shop Scheduling Problems Bai Jun-jie Wang Ning-sheng Tang Dun-bing （CMS Research centre, Nanjing Univ. Of Aeronautics and Astronautics, Nanjing 210016, Jiangsu, China） Abstract: To solve the multi-objective flexible job shop scheduling problem with large dimensional searching space, a preference based multi-objective particle swarm optimization algorithm (PMOPSO) was proposed. The preference information of decisions maker is incorporated into the algorithm to lead the searching direction. So that, not only the searching space is compressed and the efficiency of the algorithm is improved, but also just a few trade-off solutions located in preferred area are obtained in a single run, and the hard work of choosing a satisfying solution from numerous non-inferior solutions is eliminated. In the algorithm, a new expression method of preference information based on importance relationship among objectives and the value range of objectives or objective weights was proposed. With this method, not only the preference of decisions maker can be easily specified, but also the range of searching area can be adjusted properly according to the requirements of decisions maker. In view of the characteristics of preference information, a new preference information handling method, which simulates the “vote” of human society, was proposed.