A balancing problem for a mixed model assembly line with uncertain task processmg Ume anO daily model mixed changes is considered, and the objective is to minimize the work variances between stations in the line. For ...A balancing problem for a mixed model assembly line with uncertain task processmg Ume anO daily model mixed changes is considered, and the objective is to minimize the work variances between stations in the line. For the balancing problem for the scenario-based robust assembly line with a finitely large number of potential scenarios, the direct solution methodology considering all potential scenarios is quite time-consuming. A scenario relaxation algorithm that embeds genetic al- gorithm is developed. This new algorithm guarantees termination at an optimal robust solution with relatively short running time, and makes it possible to solve robust problems with large quantities of potential scenarios. Extensive computational results are reported to show the efficiency and effectiveness of the proposed algorithm.展开更多
Fault reconfiguration of shipboard power system is viewed as a typical nonlinear and multi-objective combinatorial optimization problem. A comprehensive reconfiguration model is presented in this paper, in which the r...Fault reconfiguration of shipboard power system is viewed as a typical nonlinear and multi-objective combinatorial optimization problem. A comprehensive reconfiguration model is presented in this paper, in which the restored loads, switch frequency and generator efficiency are taken into account. In this model, analytic hierarchy process(AHP) is proposed to determine the coefficients of these objective functions. Meanwhile, a quantum differential evolution algorithm with triple quantum bit code is proposed. This algorithm aiming at the characteristics of shipboard power system is different from the normal quantum bit representation. The individual polymorphic expression is realized, and the convergence performance can be further enhanced in combination with the global parallel search capacity of differential evolution algorithm and the superposition properties of quantum theory. The local optimum can be avoided by dynamic rotation gate. The validity of algorithm and model is verified by the simulation examples.展开更多
基金Supported by the National High Technology Research and Development Programme of China （No. 2006AA04Z160） and the National Natural Science Foundation of China （ No. 60874066）.
文摘A balancing problem for a mixed model assembly line with uncertain task processmg Ume anO daily model mixed changes is considered, and the objective is to minimize the work variances between stations in the line. For the balancing problem for the scenario-based robust assembly line with a finitely large number of potential scenarios, the direct solution methodology considering all potential scenarios is quite time-consuming. A scenario relaxation algorithm that embeds genetic al- gorithm is developed. This new algorithm guarantees termination at an optimal robust solution with relatively short running time, and makes it possible to solve robust problems with large quantities of potential scenarios. Extensive computational results are reported to show the efficiency and effectiveness of the proposed algorithm.
基金the National Natural Science Foundation of China(No.51175321)the Innovation Program of Shanghai Municipal Education Commission(No.12ZZ158)
文摘Fault reconfiguration of shipboard power system is viewed as a typical nonlinear and multi-objective combinatorial optimization problem. A comprehensive reconfiguration model is presented in this paper, in which the restored loads, switch frequency and generator efficiency are taken into account. In this model, analytic hierarchy process(AHP) is proposed to determine the coefficients of these objective functions. Meanwhile, a quantum differential evolution algorithm with triple quantum bit code is proposed. This algorithm aiming at the characteristics of shipboard power system is different from the normal quantum bit representation. The individual polymorphic expression is realized, and the convergence performance can be further enhanced in combination with the global parallel search capacity of differential evolution algorithm and the superposition properties of quantum theory. The local optimum can be avoided by dynamic rotation gate. The validity of algorithm and model is verified by the simulation examples.
