Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassem...Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.展开更多
To realize the requirement of diagnostic sequence optimization in the process of design for testability, the authors put forward an optimization method based on quantum-behaved particle swarm optimization （QPSO） alg...To realize the requirement of diagnostic sequence optimization in the process of design for testability, the authors put forward an optimization method based on quantum-behaved particle swarm optimization （QPSO） algorithm. By a precedence ordering coding, the diagnostic sequence optimization can be translated into a precedence ordering problem in the multidimensional space of swarm. It can get the optimizing order quickly by using the powerful and quick search capability of QPSO algorithm, and the order is the diagnostic sequence for the system. The realization of the method is simpler than other methods, and the results are more excellent than others, and it has been applied in the engineering practice.展开更多
In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a le...In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness.展开更多
In rough communication, because each agent has a different language and can not provide precise communication to each other, the concept translated among multi-agents will loss some information, and this results in a ...In rough communication, because each agent has a different language and can not provide precise communication to each other, the concept translated among multi-agents will loss some information, and this results in a less or rougher concept. With different translation sequences the amount of the missed knowledge is varied. The λ-optimal translation sequence of rough communication, which concerns both every agent and the last agent taking part in rough communication to get information as much as he （or she） can, is given. In order to get the λ-optimal translation sequence, a genetic algorithm is used. Analysis and simulation of the algorithm demonstrate the effectiveness of the approach.展开更多
A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the seg...A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the segmentation speed by three times for single image. Meanwhile, this fast segmentation algorithm is extended from single object to multiple objects and from single-image to image-sequences. Thus the segmentation of multiple objects from complex hackground and batch segmentation of image-sequences can be achieved. In addition, a post-processing scheme is incorporated in this algorithm, which extracts smooth edge with one-pixel-width for each segmented object. The experimental results illustrate that the proposed algorithm can obtain the object regions of interest from medical image or image-sequences as well as man-made images quickly and reliably with only a little interaction.展开更多
There are always large-scale items in the maintenances schedule of aircraft system, many of which have been fixed to be done in predefined sequences, which leads the workflow to be sys-tematically complex and makes th...There are always large-scale items in the maintenances schedule of aircraft system, many of which have been fixed to be done in predefined sequences, which leads the workflow to be sys-tematically complex and makes this kind of problem quite different from all sorts of existing job-selection modes. On the other hand, the human resources are always limited and men have different working capabilities on different items, which make the allocation operation of human resources be much roomy. However, the final total time span of maintenance is often required to be as short as possible in many practices, in order to suffer only the lowest cost of loss while the system is stopping. A new model for op-timizing the allocation if aircraft maintenance human resources with the constraint of predefined sequence is presented. The ge-netic algorithm is employed to find the optimal solution that holds the shortest total time span of maintenance. To generate the ul-timate maintenance work items and the human resource array, the sequences among all maintenance work items are considered firstly, the work item array is then generated through traversal with the constraint of maintenance sequence matrix, and the human resources are finally allocated according to the work item array with the constraint of the maintenance capability. An example is demonstrated to show that the model and algorithm behave a satisfying performance on finding the optimal solution as expected.展开更多
针对基于自主移动机器人(Autonomous Mobile Robot,AMR)的货到人拣选系统多拣货台场景,研究订单分配、处理顺序及货架访问顺序的集成优化,提出多拣货台订单分配与排序问题(Order Allocation and Sequencing Problem,OASP),对订单如何分...针对基于自主移动机器人(Autonomous Mobile Robot,AMR)的货到人拣选系统多拣货台场景,研究订单分配、处理顺序及货架访问顺序的集成优化,提出多拣货台订单分配与排序问题(Order Allocation and Sequencing Problem,OASP),对订单如何分配给拣货台、订单在拣货台的处理顺序及如何安排货架的访问顺序进行集成优化决策,并以最小化订单拣选时间为目标建立混合整数规划模型.设计变邻域搜索算法(the Variable Neighborhood Search Algorithm,VNSA),通过订单相似度进行分批分配并生成贪婪初始解,结合货架置换、订单重分配的抖动算子和订单交换/插入、货架序列调整等4种局部优化邻域,采用动态切换机制实现迭代寻优,并将设计的算法与CPLEX求解器进行比较.研究结果表明:VNSA算法在小规模算例中求解速度与精度优于CPLEX求解器;在大规模算例中对初始解的优化能力显著,验证了联合优化订单分配和排序的有效性;订单拣选时间与拣货台数量、容量呈负相关,与负载平衡系数呈正相关.展开更多
提升航空器运行效率,获取航空运输利益最大化,是中国民航一直以来追求的目标。研究表明,EoR进近(Established on RNP AR)在提升近距平行跑道运行效率方面具有不可替代的优势,因此受到业界广泛关注。将EoR进近与排序策略结合,以航班延误...提升航空器运行效率,获取航空运输利益最大化,是中国民航一直以来追求的目标。研究表明,EoR进近(Established on RNP AR)在提升近距平行跑道运行效率方面具有不可替代的优势,因此受到业界广泛关注。将EoR进近与排序策略结合,以航班延误时间最小为目标函数,建立基于EoR的排序模型。对比分析基于EoR的独立运行与相关运行对航班延误时间的影响。针对大规模航班排序计算时解空间较大且要求时效性的特点,提出一种基于S形函数的自适应粒子群优化算法(S-shaped function based adaptive particle swarm optimization,SA-PSO)对模型进行求解。以昆明长水国际机场终端区为例进行实例验证,尾流安全间隔上,采用中国民航航空器尾流重新分类(RECAT-CN)运行标准。结果表明:EoR独立运行较相关运行减少总延误约38%、EoR独立运行模式下,本文算法较先到先服务(first come first served,FCFS)算法减少总延误约15.3%。展开更多
基金supported by the National High Technology Research and Development Program of China(2006AA04Z427).
文摘Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.
基金supported by the National Natural Science Foundation of China(60771063).
文摘To realize the requirement of diagnostic sequence optimization in the process of design for testability, the authors put forward an optimization method based on quantum-behaved particle swarm optimization （QPSO） algorithm. By a precedence ordering coding, the diagnostic sequence optimization can be translated into a precedence ordering problem in the multidimensional space of swarm. It can get the optimizing order quickly by using the powerful and quick search capability of QPSO algorithm, and the order is the diagnostic sequence for the system. The realization of the method is simpler than other methods, and the results are more excellent than others, and it has been applied in the engineering practice.
基金the Natural Science Foundation of Shandong Province (Y2006A12)the Scientific ResearchDevelopment Project of Shandong Provincial Education Department(J06P01)the Doctoral Foundation of University of Jinan(B0633).
文摘In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness.
基金supported by the National Natural Science Foundation of China(61070241)the Natural Science Foundation of Shandong Province(ZR2010FM035)+1 种基金the Science and Technology Foundation of University of Jinan(XKY1031XKY0808)
文摘In rough communication, because each agent has a different language and can not provide precise communication to each other, the concept translated among multi-agents will loss some information, and this results in a less or rougher concept. With different translation sequences the amount of the missed knowledge is varied. The λ-optimal translation sequence of rough communication, which concerns both every agent and the last agent taking part in rough communication to get information as much as he （or she） can, is given. In order to get the λ-optimal translation sequence, a genetic algorithm is used. Analysis and simulation of the algorithm demonstrate the effectiveness of the approach.
文摘A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the segmentation speed by three times for single image. Meanwhile, this fast segmentation algorithm is extended from single object to multiple objects and from single-image to image-sequences. Thus the segmentation of multiple objects from complex hackground and batch segmentation of image-sequences can be achieved. In addition, a post-processing scheme is incorporated in this algorithm, which extracts smooth edge with one-pixel-width for each segmented object. The experimental results illustrate that the proposed algorithm can obtain the object regions of interest from medical image or image-sequences as well as man-made images quickly and reliably with only a little interaction.
文摘There are always large-scale items in the maintenances schedule of aircraft system, many of which have been fixed to be done in predefined sequences, which leads the workflow to be sys-tematically complex and makes this kind of problem quite different from all sorts of existing job-selection modes. On the other hand, the human resources are always limited and men have different working capabilities on different items, which make the allocation operation of human resources be much roomy. However, the final total time span of maintenance is often required to be as short as possible in many practices, in order to suffer only the lowest cost of loss while the system is stopping. A new model for op-timizing the allocation if aircraft maintenance human resources with the constraint of predefined sequence is presented. The ge-netic algorithm is employed to find the optimal solution that holds the shortest total time span of maintenance. To generate the ul-timate maintenance work items and the human resource array, the sequences among all maintenance work items are considered firstly, the work item array is then generated through traversal with the constraint of maintenance sequence matrix, and the human resources are finally allocated according to the work item array with the constraint of the maintenance capability. An example is demonstrated to show that the model and algorithm behave a satisfying performance on finding the optimal solution as expected.
文摘提升航空器运行效率,获取航空运输利益最大化,是中国民航一直以来追求的目标。研究表明,EoR进近(Established on RNP AR)在提升近距平行跑道运行效率方面具有不可替代的优势,因此受到业界广泛关注。将EoR进近与排序策略结合,以航班延误时间最小为目标函数,建立基于EoR的排序模型。对比分析基于EoR的独立运行与相关运行对航班延误时间的影响。针对大规模航班排序计算时解空间较大且要求时效性的特点,提出一种基于S形函数的自适应粒子群优化算法(S-shaped function based adaptive particle swarm optimization,SA-PSO)对模型进行求解。以昆明长水国际机场终端区为例进行实例验证,尾流安全间隔上,采用中国民航航空器尾流重新分类(RECAT-CN)运行标准。结果表明:EoR独立运行较相关运行减少总延误约38%、EoR独立运行模式下,本文算法较先到先服务(first come first served,FCFS)算法减少总延误约15.3%。
